Isomorphisms of simple inductive types through extensional rewriting
From MaRDI portal
Publication:3372685
DOI10.1017/S0960129505004950zbMath1096.03009MaRDI QIDQ3372685
Publication date: 10 March 2006
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
isomorphismsconfluenceinductive typesstrong normalisationconversion rulesextensional simply typed \(\lambda\)-calculusfaithful copy
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40)
Related Items (2)
An insertion operator preserving infinite reduction sequences ⋮ Conditionally reversible computations and weak universality in category theory
This page was built for publication: Isomorphisms of simple inductive types through extensional rewriting