Fixed-point operations on ccc's. I

DOI10.1016/0304-3975(95)00010-0zbMath0874.18006OpenAlexW2051175345MaRDI QIDQ672122

Stephen L. Bloom, Zoltán Ésik

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00010-0

zbMATH Keywords

Cartesian closed categoriesConway identitiesequational propertiesfixed-point operationstandard functional completeness theorem

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Semantics in the theory of computing (68Q55) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)

Related Items (11)

Parametrized fixed points and their applications to session types ⋮ An analysis of the equational properties of the well-founded fixed point ⋮ Equational properties of iteration in algebraically complete categories ⋮ Finitary Semantics of Linear Logic and Higher-Order Model-Checking ⋮ Equational Properties of Stratified Least Fixed Points (Extended Abstract) ⋮ Solving polynomial fixed point equations ⋮ The equational logic of fixed points ⋮ Typing Weak MSOL Properties ⋮ Attribute Grammars and Categorical Semantics ⋮ Equational axioms associated with finite automata for fixed point operations in cartesian categories ⋮ The calculus of signal flow diagrams. I: Linear relations on streams.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of the least-fixed-point operator by dinaturality
• Functorial polymorphism
• Categorical fixed point semantics
• Matrix and matricial iteration theories. I
• Algebraic specification of data types: A synthetic approach
• Equational axioms for regular sets
• SOME EQUATIONAL LAWS OF INITIALITY IN 2CCC’S
• Aspects of topoi
• A Perspective View of Discrete Automata and Their Design

This page was built for publication: Fixed-point operations on ccc's. I