A coinductive completeness proof for the equivalence of recursive types
type: Item
instance of: scholarly article
title: A coinductive completeness proof for the equivalence of recursive types
zbMATH Open document ID: 1026.68019
DOI: 10.1016/S0304-3975(01)00298-5
author: Felice Cardone
published in: Theoretical Computer Science
publication date: 2002-07-31T00:00:00Z
Mathematics Subject Classification ID: 68N18
zbMATH DE Number: 1774111
zbMATH Keywords: recursive types
zbMATH Keywords: coinduction
zbMATH Keywords: infinite trees
zbMATH Keywords: isomorphism of types
MaRDI profile type: Publication
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: Semantics for classical AUTOMATH and related systems
cites work: Q3837984
cites work: Provable isomorphisms of types
cites work: Q4692468
cites work: Type inference with recursive types: Syntax and semantics
cites work: Q3709890
cites work: Q4325974
cites work: Fundamental properties of infinite trees
cites work: Uniqueness of Scott's reflexive domain in \(P\omega \)
cites work: A coinduction principle for recursive data types based on bisimulation
cites work: Initial Algebra Semantics and Continuous Algebras
cites work: An ideal model for recursive polymorphic types
cites work: Universal coalgebra: A theory of systems
cites work: Data Types as Lattices
description: scientific article; zbMATH DE number 1774111