A coinductive completeness proof for the equivalence of recursive types
From MaRDI portal
Publication:1607224
DOI10.1016/S0304-3975(01)00298-5zbMath1026.68019MaRDI QIDQ1607224
Publication date: 31 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Uniqueness of Scott's reflexive domain in \(P\omega \)
- Type inference with recursive types: Syntax and semantics
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Fundamental properties of infinite trees
- Universal coalgebra: A theory of systems
- A coinduction principle for recursive data types based on bisimulation
- Semantics for classical AUTOMATH and related systems
- An ideal model for recursive polymorphic types
- Provable isomorphisms of types
- Data Types as Lattices
- Initial Algebra Semantics and Continuous Algebras
This page was built for publication: A coinductive completeness proof for the equivalence of recursive types
