Program Extraction from Nested Definitions

  • Kenji Miyamoto
  • Fredrik Nordvall Forsberg
  • Helmut Schwichtenberg
Conference paper

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

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7998)
Cite this paper as:
Miyamoto K., Nordvall Forsberg F., Schwichtenberg H. (2013) Program Extraction from Nested Definitions. 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

Minlog is a proof assistant which automatically extracts computational content in an extension of Gödel’s T from formalized proofs. We report on extending Minlog to deal with predicates defined using a particular combination of induction and coinduction, via so-called nested definitions. In order to increase the efficiency of the extracted programs, we have also implemented a feature to translate terms into Haskell programs. To illustrate our theory and implementation, a formalisation of a theory of uniformly continuous functions due to Berger is presented.

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

  • Kenji Miyamoto
    • 1
  • Fredrik Nordvall Forsberg
    • 2
  • Helmut Schwichtenberg
    • 1
  1. 1.Ludwig-Maximilians-Universität MünchenGermany
  2. 2.Swansea UniversityUK

Personalised recommendations