Equational logic of circular data type specification
From MaRDI portal
Publication:1825026
DOI10.1016/0304-3975(89)90012-1zbMath0683.68018MaRDI QIDQ1825026
Publication date: 1989
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(89)90012-1
Related Items
Equational axioms for regular sets, Equational properties of iteration in algebraically complete categories, The equational logic of fixed points
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative and recursive matrix theories
- Algebras of iteration theories
- Iterative algebras
- Recursion and iteration in continuous theories: the M-construction
- Fundamental properties of infinite trees
- On flowchart theories. II: The nondeterministic case
- Partially additive categories and flow-diagram semantics
- Varietors and machines in a category
- On the algebraic structure of rooted trees
- Fixed-point constructions in order-enriched categories
- Axiomatizing schemes and their behaviors
- Right exact functors
- Formal category theory: Adjointness for 2-categories
- Varieties of Iteration Theories
- Compatible Orderings on the Metric Theory of Trees
- Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation
- Algebraic specification of data types: A synthetic approach
- Vector Iteration in Pointed Iterative Theories
- The Category-Theoretic Solution of Recursive Domain Equations
- Data Types as Lattices
- Structured Programming With and Without go to Statements
- Initial Algebra Semantics and Continuous Algebras
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES