Proof Terms for Simply Typed Higher Order Logic

Authors:
Stefan Berghofer;Tobias Nipkow
Affiliations:
-;-
Venue:
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Year:
2000

Citing 7
Cited 12

Seventy-five problems for testing automatic theorem provers

Journal of Automated Reasoning
The foundation of a generic theorem prover

Journal of Automated Reasoning
Logic programming in the LF logical framework

Logical frameworks
Lambda calculi with types

Handbook of logic in computer science (vol. 2)
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Recording and Checking HOL Proofs

Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications
Efficient Representation and Validation of Proofs

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science

The HOL/NuPRL Proof Translator (A Practical Approach to Formal Interoperability)

TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
Extraction of Proofs from the Clausal Normal Form Transformation

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
More On Implicit Syntax

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
The Isabelle Framework

TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Certifying compilers using higher-order theorem provers as certificate checkers

Formal Methods in System Design
The open theory standard theory library

NFM'11 Proceedings of the Third international conference on NASA Formal methods
Hybrid

Journal of Automated Reasoning
Verifying and reflecting quantifier elimination for presburger arithmetic

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Importing HOL into Isabelle/HOL

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Importing HOL light into coq

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Querying proofs

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
MaSh: machine learning for sledgehammer

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents proof terms for simply typed, intuitionistic higher order logic, a popular logical framework. Unification-based algorithms for the compression and reconstruction of proof terms are described and have been implemented in the theorem prover Isabelle. Experimental results confirm the effectiveness of the compression scheme.