Foundational (co)datatypes and (co)recursion for higher-order logic

Biendarra, Julian, Blanchette, Jasmin Christian, Bouzy, Aymeric, Desharnais, Martin, Fleury, Mathias, Hölzl, Johannes, Kunčar, Ondřej, Lochbihler, Andreas, Meier, Fabian, Panny, Lorenz, Popescu, Andrei, Sternagel, Christian, Thiemann, René and Traytel, Dmitriy (2017) Foundational (co)datatypes and (co)recursion for higher-order logic. In: 11th International Symposium on Frontiers of Combining Systems, FroCoS 2017, 27-29 September 2017, Brasilia, Brazil.

[img]
Preview
PDF - Final accepted version (with author's formatting)
Download (192kB) | Preview

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.

Item Type: Conference or Workshop Item (Speech)
Additional Information: Cite this paper as: Biendarra J. et al. (2017) Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic. In: Dixon C., Finger M. (eds) Frontiers of Combining Systems. FroCoS 2017. Lecture Notes in Computer Science, vol 10483. Springer, Cham
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 23362
Notes on copyright: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-66167-4_1
Useful Links:
Depositing User: Andrei Popescu
Date Deposited: 22 Jan 2018 16:21
Last Modified: 04 Apr 2019 06:19
URI: https://eprints.mdx.ac.uk/id/eprint/23362

Actions (login required)

Edit Item Edit Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year