Realization of coinductive types
From MaRDI portal
Recommendations
Cites work
- A final coalgebra theorem
- Derivatives of Regular Expressions
- Efficient recursive subtyping
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- Logical construction of final coalgebras
- Nominal Kleene coalgebra
- On final coalgebras of continuous functors
- 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
- Terminal coalgebras in well-founded set theory
- The Category-Theoretic Solution of Recursive Domain Equations
- Universal coalgebra: A theory of systems
Cited in
(12)- Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies
- A description based on languages of the final non-deterministic automaton
- Interfaces as functors, programs as coalgebras -- a final coalgebra theorem in intensional type theory
- Types and coalgebraic structure
- New
- Dual Calculus with Inductive and Coinductive Types
- scientific article; zbMATH DE number 7376040 (Why is no real title available?)
- A coalgebraic foundation for coinductive union types
- scientific article; zbMATH DE number 7168147 (Why is no real title available?)
- Well-founded coalgebras, revisited
- Type-Theoretic Constructions of the Final Coalgebra of the Finite Powerset Functor.
- Grounding game semantics in categorical algebra
This page was built for publication: Realization of coinductive types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739360)