Realization of Coinductive Types
From MaRDI portal
Publication:5739360
DOI10.1016/j.entcs.2011.09.024zbMath1342.68217OpenAlexW2038590032WikidataQ113318221 ScholiaQ113318221MaRDI QIDQ5739360
Publication date: 15 July 2016
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2011.09.024
Related Items (6)
Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies ⋮ New ⋮ Unnamed Item ⋮ Well-founded coalgebras, revisited ⋮ Unnamed Item ⋮ A description based on languages of the final non-deterministic automaton
Cites Work
- Unnamed Item
- Unnamed Item
- On the final sequence of a finitary set functor
- On the greatest fixed point of a set functor
- Solving reflexive domain equations in a category of complete metric spaces
- On final coalgebras of continuous functors
- Universal coalgebra: A theory of systems
- Terminal coalgebras in well-founded set theory
- Nominal Kleene Coalgebra
- The Category-Theoretic Solution of Recursive Domain Equations
- Efficient recursive subtyping
- A final coalgebra theorem
- Derivatives of Regular Expressions
This page was built for publication: Realization of Coinductive Types
