Subtyping, Declaratively
From MaRDI portal
Publication:3575268
DOI10.1007/978-3-642-13321-3_8zbMath1286.68074OpenAlexW4254626787WikidataQ61583812 ScholiaQ61583812MaRDI QIDQ3575268
Nils Anders Danielsson, Thorsten Altenkirch
Publication date: 26 July 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13321-3_8
Related Items
Bisimulations Generated from Corecursive Equations ⋮ A Mechanized Theory of Regular Trees in Dependent Type Theory ⋮ A logical framework with higher-order rational (circular) terms ⋮ Polarized subtyping ⋮ Coalgebras in functional programming and type theory ⋮ Indexed containers ⋮ The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types ⋮ Compositional Coinduction with Sized Types ⋮ Unnamed Item ⋮ Undecidability of equality for codata types
Uses Software
