Closure functions and general iterates as reflectors

DOI10.1016/0304-3975(91)90223-OzbMath0731.68073MaRDI QIDQ808275

Stefano Mazzanti, Giorgio Germano

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

semantics of programsclosure functionsclosure theory for categoriesgeneral iterateswhile-do statements

Mathematics Subject Classification ID

Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

General iteration and unary functions, Closures on CPOs form complete lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterative algebras
• A conjunction in closure spaces
• Retracts of the closure space of filters in the lattice of all subsets
• Universality of the closure space of filters in the algebra of all subsets
• Primitive iteration and unary functions
• Computable stack functions for semantics of stack programs
• Sequence recursiveness without cylindrification and limited register machines
• General iteration and unary functions
• Proving a compiler correct: A simple approach
• Sequence-to-sequence recursiveness
• The existence and construction of free iterative theories
• Parallel realization of systems, using factorizations and quotients in categories
• Free monads and the orthogonal subcategory problem
• Adjoint functors and triples
• Topologische Reflexionen und Coreflexionen
• Equivalence of partial recursivity and computability by algorithms without concluding formulas
• General recursive functions of natural numbers
• The meaning of completeness
• Undecidable theories
• Some studies on closure relations
• Combinations of closure relations
• The closure operators of a lattice
• Primitive Recursive Functions. II
• A Note on Primitive Recursive Functions
• Recursive functions of symbolic expressions and their computation by machine, Part I
• On the Algebraic Structure of Primitive Recursive Functions
• On the power of list iteration
• Filter Monads, Continuous Lattices and Closure Systems
• The theory of recursive functions, approaching its centennial
• Data Types as Lattices
• Another simplification of the recursion scheme
• Functional completeness of cartesian categories
• A flow diagram composition of Markov's normal algorithms without concluding formulas
• Reflective Functors in General Topology and Elsewhere
• Flow diagrams, turing machines and languages with only two formation rules
• A reduction of the recursion scheme
• ITERATION AND RECURSION
• Coreflective Subcategories
• Simplifications of the recursion scheme
• Localization at Injectives in Complete Categories
• Aspects of topoi
• Computability of Recursive Functions
• Grundzüge des Systemenkalküls II
• A note on recursive functions
• Primitive recursive functions
• General Recursive Functions
• Closure Operators and Galois Theory in Lattices