Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic

Abstract : We describe a line of work that started in 2011 towards enriching Isabelle/HOL's language with coinductive datatypes, which allow infinite values, and with a more expressive notion of inductive datatype than previously supported by any system based on higher-order logic. These (co)datatypes are complemented by definitional principles for (co)recursive functions and reasoning principles for (co)induction. In contrast with other systems offering codatatypes, no additional axioms or logic extensions are necessary with our approach.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [54 references]  Display  Hide  Download
Contributor : Stephan Merz <>
Submitted on : Wednesday, September 27, 2017 - 3:12:59 PM
Last modification on : Wednesday, April 3, 2019 - 1:23:03 AM
Document(s) archivé(s) le : Thursday, December 28, 2017 - 12:42:34 PM


Files produced by the author(s)



Julian Biendarra, Jasmin Blanchette, Aymeric Bouzy, Martin Desharnais, Mathias Fleury, et al.. Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic. Frontiers of Combining Systems, 11th International Symposium, Sep 2017, Brasilia, Brazil. pp.3-21, ⟨10.1007/978-3-319-66167-4_1⟩. ⟨hal-01592196⟩



Record views


Files downloads