Fixed-point constructions in order-enriched categories

DOI10.1016/0304-3975(79)90053-7zbMath0401.18005OpenAlexW2080801189MaRDI QIDQ1255084

Mitchell Wand

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0304-3975(79)90053-7

zbMATH Keywords

Category of Complete Directed RelationsCategory Of Complete Partial OrderCategory of Continuous LatticesEndofunctorFixed-Point ConstructionsInverse Limit ConstructionOrder-Enriched Categories

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Ordered sets (06A99) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Categorical structures (18D99)

Related Items

Banach's fixed-point theorem as a base for data-type equations, Unnamed Item, On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory, Equational properties of iteration in algebraically complete categories, The equational logic of fixed points, A formal logic for formal category theory, On the algebra of order, Varieties of chain-complete algebras, The glueing construction and lax limits, A note on ordinal DFAs, Sets with structure, mappings and fixed point property: fixed point structures, Recursion-closed algebraic theories, Tree constructions of free continuous algebras, Non-deterministic information systems and their domains, Unguarded recursion on coinductive resumptions, Towards a foundation for semantics in complete metric spaces, Recursion over realizability structures, Call-by-name Gradual Type Theory, Unnamed Item, Unnamed Item, Quantitative domains and infinitary algebras, Unnamed Item, Unnamed Item, Unnamed Item, Three counterexamples concerning ω-chain completeness and fixed point properties, ALGEBRAIC LINEAR ORDERINGS, Categorical fixed point semantics, Algebraic specification of data types: A synthetic approach, Equational logic of circular data type specification, A Mezei-Wright theorem for categorical algebras, Algebraic domain equations, Unnamed Item, The Bicategory-Theoretic Solution of Recursive Domain Equations, Partially ordered objects in a topos

Uses Software

• ALGOL 68

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Categories of chain-complete posets
• Generalized sequential machine maps
• Kan extensions in enriched category theory
• Pair grammars, graph languages and string-to-graph translations
• The Category-Theoretic Solution of Recursive Domain Equations
• Data Types as Lattices
• Adjointness in Foundations
• A Powerdomain Construction
• Initial Algebra Semantics and Continuous Algebras
• Generalized finite automata theory with an application to a decision problem of second-order logic
• The minimalization of tree automata
• Fixpoint approach to the theory of computation
• Equational languages