Truly modular (co)datatypes for Isabelle/HOL

Blanchette, Jasmin Christian, Hölzl, Johannes, Lochbihler, Andreas, Panny, Lorenz, Popescu, Andrei and Traytel, Dmitriy (2014) Truly modular (co)datatypes for Isabelle/HOL. In: 5th International Conference on Interactive Theorem Proving (ITP), 14-17 Jul 2014, Vienna, Austria.

This is the latest version of this item.

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

Abstract

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 primitive (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.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Online ISBN: 9783319089706 Published paper appears in: Interactive Theorem Proving, Volume 8558 of the series Lecture Notes in Computer Science pp 93-110, 2014
Research Areas: A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 15167
Notes on copyright: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-08970-6_7
Useful Links:
Depositing User: Andrei Popescu
Date Deposited: 23 Apr 2015 09:32
Last Modified: 04 Apr 2019 06:33
URI: https://eprints.mdx.ac.uk/id/eprint/15167

Available Versions of this Item

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