Truly Modular (Co)datatypes for Isabelle/HOL

  • Jasmin Christian Blanchette
  • Johannes Hölzl
  • Andreas Lochbihler
  • Lorenz Panny
  • Andrei Popescu
  • Dmitriy Traytel
Conference paper

DOI: 10.1007/978-3-319-08970-6_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8558)
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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Jasmin Christian Blanchette
    • 1
  • Johannes Hölzl
    • 1
  • Andreas Lochbihler
    • 2
  • Lorenz Panny
    • 1
  • Andrei Popescu
    • 1
    • 3
  • Dmitriy Traytel
    • 1
  1. 1.Fakultät für InformatikTechnische Universität MünchenGermany
  2. 2.Institute of Information SecurityETH ZurichSwitzerland
  3. 3.Institute of Mathematics Simion Stoilow of the Romanian AcademyBucharestRomania

Personalised recommendations