Recursion and corecursion have the same equational logic

DOI10.1016/S0304-3975(01)00242-0zbMath1029.03018MaRDI QIDQ1398467

Lawrence S. Moss

Publication date: 29 July 2003

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

zbMATH Keywords

final coalgebrafixed-point equationsEquational logicIteration theoryCorecursion

Mathematics Subject Classification ID

Logic in computer science (03B70) Applications of universal algebra in computer science (08A70) Abstract and axiomatic computability and recursion theory (03D75)

Related Items

A complete logic for behavioural equivalence in coalgebras of finitary set functors ⋮ Equational properties of iterative monads ⋮ Elgot theories: a new perspective on the equational properties of iteration ⋮ A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors ⋮ Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract) ⋮ Unnamed Item

Cites Work

• Equational properties of iteration in algebraically complete categories
• Festschrift on the occasion of Professor Rohit Parikh's 60th birthday
• The equational logic of fixed points
• Universal coalgebra: A theory of systems
• The formal language of recursion
• Vector Iteration in Pointed Iterative Theories
• The logic of recursive equations
• Equational axioms for regular sets
• Parametric corecursion
• Unnamed Item
• Unnamed Item