Fixed-point constructions in order-enriched categories

DOI10.1016/0304-3975(79)90053-7MaRDI QIDQ1255084zbMATH OpenOpenAlexFDO

Authors 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) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Categorical structures (18D99) Ordered sets (06A99)

Cites work

• scientific article; zbMATH DE number 3490449 (Why is no real title available?)
• scientific article; zbMATH DE number 3438414 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• scientific article; zbMATH DE number 3379785 (Why is no real title available?)
• scientific article; zbMATH DE number 3387568 (Why is no real title available?)
• A Powerdomain Construction
• Adjointness in Foundations
• Categories of chain-complete posets
• Data Types as Lattices
• Equational languages
• Fixpoint approach to the theory of computation
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Generalized sequential machine maps
• Initial Algebra Semantics and Continuous Algebras
• Kan extensions in enriched category theory
• Pair grammars, graph languages and string-to-graph translations
• The Category-Theoretic Solution of Recursive Domain Equations
• The minimalization of tree automata

Cited in

(35)

• Unguarded recursion on coinductive resumptions
• The glueing construction and lax limits
• Towards a foundation for semantics in complete metric spaces
• Non-deterministic information systems and their domains
• Quantitative domains and infinitary algebras
• Unguarded recursion on coinductive resumptions
• Categorical fixed point semantics
• A note on ordinal DFAs
• Equational properties of iteration in algebraically complete categories
• scientific article; zbMATH DE number 7052238 (Why is no real title available?)
• Algebraic linear orderings
• The equational logic of fixed points
• A formal logic for formal category theory
• Varieties of chain-complete algebras
• Three counterexamples concerning ω-chain completeness and fixed point properties
• Equational logic of circular data type specification
• Banach's fixed-point theorem as a base for data-type equations
• Tree constructions of free continuous algebras
• Sets with structure, mappings and fixed point property: fixed point structures
• Recursion over realizability structures
• Partially ordered objects in a topos
• scientific article; zbMATH DE number 1522144 (Why is no real title available?)
• scientific article; zbMATH DE number 1525070 (Why is no real title available?)
• scientific article; zbMATH DE number 3907742 (Why is no real title available?)
• scientific article; zbMATH DE number 1555491 (Why is no real title available?)
• Algebraic specification of data types: A synthetic approach
• A Mezei-Wright theorem for categorical algebras
• Call-by-name gradual type theory
• On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
• Algebraic domain equations
• On the algebra of order
• Recursion-closed algebraic theories
• Call-by-name gradual type theory
• The bicategory-theoretic solution of recursive domain equations
• Categorical approximation fixpoint theory

Describes a project that uses

Uses Software

• ALGOL 68

This page was built for publication: Fixed-point constructions in order-enriched categories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1255084)