Download PDFOpen PDF in browserTermination Checking in the Presence of Nested Inductive and Coinductive Types6 pages•Published: May 15, 2012AbstractIn the dependently typed functional programming language Agda one can easily mix induction and coinduction. The implementation of the termination/productivity checker is based on a simple extension of a termination checker for a language with inductive types. However, this simplicity comes at a price: only types of the form νX.μY.F X Y can be handled directly, not types of the form μY.νX.F X Y. We explain the implementation of the termination checker and the ensuing problem.Keyphrases: coinduction, corecursion, dependent types, mixed induction and coinduction In: Ekaterina Komendantskaya, Ana Bove and Milad Niqui (editors). PAR-10. Partiality and Recursion in Interactive Theorem Provers, vol 5, pages 101-106.
|