Data Refinement in Isabelle/HOL

  • Florian Haftmann
  • Alexander Krauss
  • Ondřej Kunčar
  • Tobias Nipkow
Conference paper

DOI: 10.1007/978-3-642-39634-2_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7998)
Cite this paper as:
Haftmann F., Krauss A., Kunčar O., Nipkow T. (2013) Data Refinement in Isabelle/HOL. In: Blazy S., Paulin-Mohring C., Pichardie D. (eds) Interactive Theorem Proving. ITP 2013. Lecture Notes in Computer Science, vol 7998. Springer, Berlin, Heidelberg

Abstract

The paper shows how the code generator of Isabelle/HOL supports data refinement, i.e., providing efficient code for operations on abstract types, e.g., sets or numbers. This allows all tools that employ code generation, e.g., Quickcheck or proof by evaluation, to compute with these abstract types. At the core is an extension of the code generator to deal with data type invariants. In order to automate the process of setting up specific data refinements, two packages for transferring definitions and theorems between types are exploited.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Florian Haftmann
    • 1
  • Alexander Krauss
    • 1
  • Ondřej Kunčar
    • 1
  • Tobias Nipkow
    • 1
  1. 1.Technische Universität MünchenGermany

Personalised recommendations