Infinite objects in type theory
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Proof, language, and interaction
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Information Processing Letters - Special issue in honor of Edsger W. Dijkstra
Conservativity of Equality Reflection over Intensional Type Theory
TYPES '95 Selected papers from the International Workshop on Types for Proofs and Programs
A coinductive calculus of streams
Mathematical Structures in Computer Science
Interfaces as functors, programs as coalgebras: a final coalgebra theorem in intensional type theory
Theoretical Computer Science
PLPV '07 Proceedings of the 2007 workshop on Programming languages meets program verification
Inductive and Coinductive Components of Corecursive Functions in Coq
Electronic Notes in Theoretical Computer Science (ENTCS)
An induction principle for nested datatypes in intensional type theory
Journal of Functional Programming
A unifying approach to recursive and co-recursive definitions
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
| Hi-index | 0.00 |
In this work we present a modular theory of the coalgebras and bisimulation in the intensional type theory implemented in coq . On top of that we build the theory of weakly final coalgebras and develop the λ -coiteration scheme, thereby extending the class of specifications definable in coq . We provide an instantiation of the theory for the coalgebra of streams and show how some of the productive specifications violating the guardedness condition of coq can be formalised using our library.