Final Dialgebras: From Categories to Allegories

DOI10.1051/ita:1999126zbMath0943.68014OpenAlexW2101475163MaRDI QIDQ4943551

Paul F. Hoogendijk, Roland C. Backhouse

Publication date: 11 May 2000

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/221963

zbMATH Keywords

coinductive types

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (2)

On difunctions ⋮ Datatype-generic termination proofs

Uses Software

• Polyp

Cites Work

• Functional programming languages and computer architecture. 5th ACM conference, Cambridge, MA, USA, August 26-30, 1991. Proceedings
• Category theory and computer science. Manchester, UK, September 5--8, 1989. Proceedings
• A semantics for shape
• A fixpoint theorem for complete categories
• Generic functional programming with types and relations
• Subequalizers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Final Dialgebras: From Categories to Allegories