Every coalgebra for a well-founded functor on a category of families indexed by a well-founded relation is recursive.
Modelling general recursion in type theory
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
citing papers explorer
-
Intrinsically Correct Algorithms and Recursive Coalgebras
Every coalgebra for a well-founded functor on a category of families indexed by a well-founded relation is recursive.
- Generalized Decidability via Brouwer Trees