A co-induction principle for recursively defined domains
From MaRDI portal
Publication:1318702
DOI10.1016/0304-3975(94)90014-0zbMath0795.68129OpenAlexW2010663699MaRDI QIDQ1318702
Publication date: 5 April 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90014-0
partial orderbisimulationsdenotational semanticsgreatest fixed pointco-induction principlehigher-order functional programming languagespowerdomain constructorsrecursively defined datatypesrecursively defined predomains
Related Items
Open maps, behavioural equivalences, and congruences, Codifying guarded definitions with recursive schemes, Safety of Nöcker's strictness analysis, Intuitionistic sets and ordinals, Strong categorical datatypes II: A term logic for categorical programming, Simulations in coalgebra, A fixedpoint approach to implementing (Co)inductive definitions, Coinductive big-step operational semantics, Structural induction and coinduction in a fibrational setting, Using a generalisation critic to find bisimulations for coinductive proofs, Universal coalgebra: A theory of systems, A type-theoretical alternative to ISWIM, CUCH, OWHY
Uses Software
Cites Work