Proof terms for simply typed higher order logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1869, Issue , 2000, Pages 38-52

  Berghofer, Stefan ^a   Nipkow, Tobias ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LOGIC;

COMPRESSION SCHEME; HIGHER ORDER LOGIC; ISABELLE; LOGICAL FRAMEWORKS; THEOREM PROVERS;

THEOREM PROVING;

EID: 84949203694     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44659-1_3     Document Type: Conference Paper

References (14)

1. [1] H. P. Barendregt. Lambda calculi with types. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 118-309. Oxford University Press, 1992.
2. [2] B. Barras, S. Boutin, C. Cornes, J. Courant, Y. Coscoy, D. Delahaye, D. de Rauglaudre, J.-C. Filliatre, E. Gimenez, H. Herbelin, G. Huet, H. Laulhere, C. Munoz, C. Murthy, C. Parent-Vigouroux, P. Loiseleur, C. Paulin-Mohring, A. Sai'bi, and B. Werner. The Coq proof assistant reference manual, version 6.3.1. Technical report, INRIA, 1999.
3. [3] M. J. C. Gordon, J. M. J. Herbert, R. W. S. Hale, J. Harri son, W. Wong, and J. Von Wright. Self-checking prover study - final report. Technical report, SRI, 1995. Available at http://www.csl.sri.com/reports/postscript/proofchecker.ps.gz.
4. [4] D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, l(4):497-536, 1991.
5. [5] G. C. Necula. Proof-carrying code. In Conference Record of POPL '97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 106-119. ACM Press, New York, 1997.
6. [6] G. C. Necula and P. Lee. Efficient representation and validation of proofs. In 13th IEEE Symp. Logic in Computer Science (LICS'98), pages 93-104. IEEE Computer Society Press, 1998.
7. [7] T. Nipkow. Functional unification of higher-order patterns. In 8th IEEE Symp. Logic in Computer Science, pages 64-74. IEEE Computer Society Press, 1993.
8. [8] L. C. Paulson. The foundation of a generic theorem prover. Journal of Automated Reasoning, 5:363-397, 1989.
9. [9] L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of LNCS. Springer, 1994
10. [10] F. J. Pelletier. Seventy-five problems for testing automatic theorem provers. Journal of Automated Reasoning, 2:191-216, 1986
11. [11] F. Pfenning. Logic programming in the LF Logical Framework. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 66-78. Cambridge University Press, 1991
12. [12] F. Pfenning. Unification and anti-unification in the calculus of constructions. In 6th IEEE Symposium on Logic in Computer Science, pages 74-85. IEEE Computer Society Press, 1991
13. [13] Z. Qian. Unification of higher-order patterns in linear time and space. Journal of Logic and Computation, 6:315-341, 1996
14. [14] W. Wong. Recording and checking HOL proofs. In E. Schubert, P. Windley, and J. Alves-Foss, editors, Higher Order Logic Theorem Proving and Its Applications. 8th International Workshop, volume 971 of LNCS, pages 353-68. Springer-Verlag, Berlin, 1995.