Programming and computing in hol

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

Volumn 1869, Issue , 2000, Pages 17-37

  Barras, Bruno ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGEBRA; FORMAL LOGIC;

ABSTRACT REDUCTION; COMPUTER ALGEBRA SYSTEMS; INFERENCE RULES;

THEOREM PROVING;

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

References (15)

1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Levy. Explicit substitutions. In Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, San Francisco, California, pages 31-46. ACM, January 1990. Also Digital Equipment Corporation, Systems Research Center, Research Report 54, February 1990.
2. H. Barendregt. Lambda Calculi with Types. Technical Report 91-19, Catholic University Nijmegen, 1991. In Handbook of Logic in Computer Science, Vol 2.
3. B. Barras. Auto-validation d'un systeme de preuves avec families inductives. These de doctorat, Universite Paris 7, November 1999.
4. B. Barras, S. Boutin, C. Cornes, J. Courant, J.-C. Filliatre, E. Gimenez, H. Herbe-lin, G. Huet, C. Mufioz, C. Murthy, C. Parent, C. Paulin, A. Sa'fbi, and B. Werner. The Coq Proof Assistant Reference Manual version 6.1. Technical Report 0203, Projet Coq-INRIA Rocquencourt-ENS Lyon, August 1997.
5. R. J. Boulton. Lazy techniques for fully expansive theorem proving. Formal Methods in System Design, 3(l/2):25-47, August 1993.
6. S. Boutin. Using reflection to build efficient and certified decision procedures. In Martin Abadi and Takahashi Ito, editors, TACS'97, volume 1281. LNCS, Springer-Verlag, 1997.
7. P. Cregut. An abstract machine for A-terms normalization. In Gilles Kahn, editor, Proceedings of the ACM Conference on LISP and Functional Programming, pages 333-340, Nice, France, June 1990. ACM Press.
8. Pierre-Louis Curien, Therese Hardin, and Jean-Jacques Levy. Confluence properties of weak and strong calculi of explicit substitutions. Journal of the ACM, 43(2):362-397, March 1996.
9. N.J. De Bruijn. Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the church-rosser theorem. Indag. Math., 34 (5), pp. 381-392, 1972.
10. M. J. C. Gordon and T. F. Melham. Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.
11. M.J. Gordon, R. Milner, and C. Wadsworth. Edinburgh LCF. LNCS 78. Springer-Verlag, 1979.
12. P.-A. Mellies. Typed A-calculi with explicit substitutions may not terminate. In M. Dezani-Ciancaglini and G. Plotkin, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, Edinburgh, Scotland, April 1995. Springer-Verlag LNCS 902.
13. Lawrence C. Paulson. A higher-order implementation of rewriting. Science of Computer Programming, 3:119-149, 1983.
14. Lawrence C. Paulson. Logic and Computation: Interactive proof with Cambridge LCF. Cambridge University Press, 1987.
15. K. Slind. Function definition in higher order logic. In J. von Wright, J. Grundy, and J. Harrison, editors, Theorem Proving in Higher Order Logics: 9th International Conference, Turku, Finland, volume 1125, pages 381-397. LNCS, Springer-Verlag, August 1996.