Nonfree datatypes in Isabelle/HOL: animating a many-sorted metatheory

Schropp, Andreas and Popescu, Andrei (2013) Nonfree datatypes in Isabelle/HOL: animating a many-sorted metatheory. Certified Programs and Proofs: third international conference, CPP 2013, Melbourne, VIC, Australia, December 11-13, 2013, Proceeding. In: Certified Programs and Proofs (CPP), 11-13 Dec 2013, Melbourne, Australia. ISBN 9783319035444. ISSN 0302-9743 (doi:10.1007/978-3-319-03545-1_8)

Download (218kB) | Preview


Datatypes freely generated by their constructors are well supported in mainstream proof assistants. Algebraic specification languages offer more expressive datatypes on axiomatic means: nonfree datatypes generated from constructors modulo equations. We have implemented an Isabelle/HOL package for nonfree datatypes, without compromising foundations. The use of the package, and its nonfree iterator in particular, is illustrated with examples: bags, polynomials and λ-terms modulo α-equivalence. The many-sorted metatheory of nonfree datatypes is formalized as an ordinary Isabelle theory and is animated by the package into user-specified instances. HOL lacks a type of types, so we employ an ad hoc construction of a universe embedding the relevant parameter types.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Volume 8307 of the series Lecture Notes in Computer Science
Research Areas: A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 15368
Notes on copyright: The final publication is available at Springer via
Useful Links:
Depositing User: Andrei Popescu
Date Deposited: 27 Apr 2015 12:30
Last Modified: 04 Apr 2019 19:10

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