论文信息 - Proof Terms for Simply Typed Higher Order Logic

Proof Terms for Simply Typed Higher Order Logic

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.

Tobias Nipkow | Stefan Berghofer | T. Nipkow | Stefan Berghofer

[1] Frank Pfenning,et al. Unification and anti-unification in the calculus of constructions , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[2] Dale Miller,et al. A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification , 1991, J. Log. Comput..

[3] F. Pfenning. Logic programming in the LF logical framework , 1991 .

[4] T. Nipkom. Functional unification of higher-order patterns , 1993, LICS 1993.

[5] Lawrence Charles Paulson,et al. Isabelle: A Generic Theorem Prover , 1994 .

[6] Jim Alves-Foss,et al. Higher Order Logic Theorem Proving and its Applications 8th International Workshop, Aspen Grove, Ut, Usa, September 11-14, 1995 : Proceedings , 1995 .

[7] Wai Wong,et al. Recording and Checking HOL Proofs , 1995, TPHOLs.

[8] Zhenyu Qian,et al. Unification of Higher-Order Patterns in Linear Time and Space , 1996, J. Log. Comput..

[9] Hugo Herbelin,et al. The Coq proof assistant : reference manual, version 6.1 , 1997 .

[10] George C. Necula,et al. Efficient representation and validation of proofs , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).