Truly Modular (Co)datatypes for Isabelle/HOL
- Cite this paper as:
- Blanchette J.C., Hölzl J., Lochbihler A., Panny L., Popescu A., Traytel D. (2014) Truly Modular (Co)datatypes for Isabelle/HOL. In: Klein G., Gamboa R. (eds) Interactive Theorem Proving. ITP 2014. Lecture Notes in Computer Science, vol 8558. Springer, Cham
We extended Isabelle/HOL with a pair of definitional commands for datatypes and codatatypes. They support mutual and nested (co)recursion through well-behaved type constructors, including mixed recursion–corecursion, and are complemented by syntaxes for introducing primitively (co)recursive functions and by a general proof method for reasoning coinductively. As a case study, we ported Isabelle’s Coinductive library to use the new commands, eliminating the need for tedious ad hoc constructions.
Unable to display preview. Download preview PDF.