IJCAR 2006: Automated Reasoning pp 162-176

Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics

  • Robert Constable
  • Wojciech Moczydłowski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4130)

Abstract

Church’s Higher Order Logic is a basis for proof assistants — HOL and PVS. Church’s logic has a simple set-theoretic semantics, making it trustworthy and extensible. We factor HOL into a constructive core plus axioms of excluded middle and choice. We similarly factor standard set theory, ZFC, into a constructive core, IZF, and axioms of excluded middle and choice. Then we provide the standard set-theoretic semantics in such a way that the constructive core of HOL is mapped into IZF. We use the disjunction, numerical existence and term existence properties of IZF to provide a program extraction capability from proofs in the constructive core.

We can implement the disjunction and numerical existence properties in two different ways: one modifying Rathjen’s realizability for CZF and the other using a new direct weak normalization result for intensional IZF by Moczydłowski. The latter can also be used for the term existence property.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Robert Constable
    • 1
  • Wojciech Moczydłowski
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations