HOL-λσ: An intentional first-order expression of higher-order logic

Mathematical Structures in Computer Science

Volumn 11, Issue 1, 2001, Pages 21-45

  Dowek, Gilles ^a   Hardin, Therese ^b   Kirchner, Claude ^c  

^a INRIA ROCQUENCOURT   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^c LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0009950979     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129500003236     Document Type: Article

References (35)

1. Abadi, M., Cardelli, L., Curien, P.-L. and Levy, J.-J. (1991) Explicit substitutions. Journal of Functional Programming 1 (4) 375–416.
2. Andrews, P. (1971) Resolution in type theory. Journal of Symbolic Logic 36 414–432.
3. Andrews, P. (1972) General models, descriptions and choice in type theory. The Journal of Symbolic Logic 37 (2) 385–394. Andrews, P. (1986) An Introduction to Mathematical Logic and Type Theory: To Truth through Proof, Academic Press.
4. Barendregt, H. P. (1984) The Lambda-Calculus, its syntax and semantics, Second edition Studies in Logic and the Foundation of Mathematics Elsevier Science.
5. Church, A. (1940) A formulation of the simple theory of types. Journal of Symbolic Logic 5 56–68.
6. Curien, P.-L., Hardin, T. and Levy, J.-J. (1996) Confluence properties of weak and strong calculi of explicit substitutions. Journal of the ACM 43 (2) 362–397.
7. Dowek, G., Hardin, T. and Kirchner, C. (1998) Theorem proving modulo. Rapport de Recherche 3400, Institut National de Recherche en Informatique et en Automatique. (To appear in Journal of Automated Reasoning)
8. Dowek, G., Hardin, T. and Kirchner, C. (1999) hol-an intentional first-order expression of higher-order logic. In: Narendran, P. and Rusinowitch, M. (eds) Rewriting Techniques and Applications. Springer-Verlag Lecture Notes in Computer Science 1631 317–331.
9. Dowek, G., Hardin, T. and Kirchner, C. (2000) Higher-order unification via explicit substitutions. Information and Computation 157 183–235.
10. Dowek, G., Hardin, T., Kirchner, C. and Pfenning, F. (1996) Unification via explicit substitutions: The case of higher-order patterns. In: Maher, M. (ed.) Joint International Conference and Symposium on Programming Logic, The MIT press 259–273.
11. Dowek, G. and Werner, B. (1999) Proof normalization modulo. In: Types for proofs and programs 98. Springer-Verlag Lecture Notes in Computer Science 1657 62–77.
12. Girard, J.-Y. (1970) Une extension de l'interpretation de Godel a l'analyse et son application a l'elimination des coupures dans l'analyse et la theorie des types. In: Fenstad, J.E. (ed.) Second Scandinavian Logic Symposium, North-Holland.
13. Girard, J.-Y. (1972) Interpretation fonctionnelle et elimination des coupures dans l'arithmetique d'ordre superieur, Ph. D. thesis, Paris.
14. Girard, J.-Y., Lafont, Y. and Taylor, P. (1989) Proofs and Types, Cambridge Tracts in Theoretical Computer Science 7, Cambridge University Press.
15. Goubault-Larrecq, J. (1997) A proof of weak termination of the simply-typed calculus. Technical Report 3090, INRIA.
16. Hindley, J. (1964) The Church–Rosser Property and a Result in Combinatory Logic, Ph. D. thesis, University of Newcastle-upon-Tyne.
17. Huet, G. (1972) Constrained Resolution: A Complete Method for Type Theory, Ph. D. thesis, Case Western Reserve University.
18. Huet, G. (1973) A mechanization of type theory. In: Proceedings of the Third International Joint Conference on Articifical Intelligence 139–146.
19. Jouannaud, J.-P. and Kirchner, H. (1986) Completion of a set of rules modulo a set of equations. SIAM Journal of Computing 15 (4) 1155–1194. (Preliminary version in Proceedings 11th ACM Symposium on Principles of Programming Languages, Salt Lake City (USA) 1984.)
20. Kirchner, C. and Ringeissen, C. (1997) Higher-Order Equational Unification via Explicit Substitutions. In: Proceedings 6th International Joint Conference ALP'97-HOA'97 Southampton, UK. Springer-Verlag Lecture Notes in Computer Science 1298 61–75.
21. Klop, J., van Oostrom, V. and van Raamsdonk, F. (1993) Combinatory reduction systems: introduction and survey. Theoretical Computer Science 121 279–308.
22. Magnusson, L. (1994) The implementation of ALF, a proof editor based on Martin-Löf monomorphic type theory with explicit substitution, Doctoral thesis, Chalmers University of Technology and University of Goteborg.
23. Marche, C. (1994) Normalised rewriting and normalised completion. In: Abramsky, S. (ed.) Proceedings 9th IEEE Symposium on Logic in Computer Science, Paris, France 394–403. Mellies, P.-A. (1995) Typed 2-calculi with explicit substitutions may not terminate. In: Typed Lambda Calculi and Applications. Springer-Verlag Lecture Notes in Computer Science 902 328—334.
24. Miller, D. (1983) Proofs in higher order logic, Ph. D. thesis, Carnegie Mellon University.
25. Miller, D. (1987) A compact representation of proofs. Studia Logica XLVI (4) 347–370.
26. Muoz, C. (1997) A left linear variant of. In: Proceedings 6th International Joint Conference ALP'97-HOA97, Southampton, UK. Springer-Verlag Lecture Notes in Computer Science 1298.
27. Muoz, C. 1997 Un calcul de substitutions pour la representation de preuves partielles en theorie de types, These de doctorat, Universite Paris 7.
28. Nadathur, G. and Wilson, D. S. (1990) A representation of lambda terms suitable for operations on their intensions. In: Wand, M. (ed.) Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, ACM Press 341–348.
29. Nadathur, G. and Wilson, D. S. (1998) A notation for lambda terms: A generalization of environments. Theoretical Computer Science 198 (12) 49-98.
30. Peterson, G. and Stickel, M. (1981) Complete sets of reductions for some equational theories. Journal of the ACM 28 233–264.
31. Plotkin, G. (1972) Building-in equational theories. Machine Intelligence 7 73–90.
32. Rosen, B. (1973) Tree manipulation systems and Church–Rosser theorems. J. Assoc. Comput. Mach. 20 160–187.
33. Stickel, M. (1985) Automated deduction by theory resolution. Journal of Automated Reasoning 1 (4) 285–289.
34. Viry, P. (1995) Rewriting modulo a rewrite system. Technical report TR-20/95, Dipartimento di informatica, Universita di Pisa.
35. Viry, P. (1998) Adventures in sequent calculus modulo equations. In: Kirchner, C. and Kirchner, H. (eds.) Proceedings of the 2nd International Workshop on Rewriting Logic and its Applications, WRLA'98, Pont-a-Mousson, France. Electronic Notes in Theoretical Computer Science 15.