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

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

Volumn 1631, Issue , 1999, Pages 317-331

  Dowek, Gilles ^a   Hardin, Thérèse ^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

CALCULATIONS; DIFFERENTIATION (CALCULUS); FORMAL LOGIC; RECONFIGURABLE HARDWARE;

EXPLICIT SUBSTITUTIONS; EXTENSIONALITY; FIRST ORDER; HIGHER ORDER LOGIC; HIGHER-ORDER; LAMBDA CALCULUS; PROOF-SEARCH METHODS;

COMPUTER CIRCUITS;

EID: 84957619183     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48685-2_26     Document Type: Conference Paper

References (25)

1. ACCL91. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 1(4):375-416, 1991.
2. And71. P. Andrews. Resolution in type theory. Journal of Symbolic Logic, 36:414-432, 1971.
3. And72. P. Andrews. General models, descriptions and choice in type theory. The Journal of Symbolic Logic, 37(2):385-394, 1972.
4. And86. P. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth through Proof. Academic Press inc., New York, 1986.
5. Chu40. A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56-68, 1940.
6. DHK95. G. Dowek, T. Hardin, and C. Kirchner. Higher-order unification via explicit substitutions, extended abstract. In D. Kozen, editor, Proceedings of LICS'95, pages 366-374, San Diego, June 1995.
7. DHK98a. G. Dowek, T. Hardin, and C. Kirchner. HOL-λσ an intentional first-order expression of higher-order logic. Rapport de Recherche 3556, Institut National de Recherche en Informatique et en Automatique, November 1998. http://coq.inria.fr/~dowek/3556.ps.gz.
8. DHK98b. G. Dowek, T. Hardin, and C. Kirchner. Theorem proving modulo. Rapport de Recherche 3400, Institut National de Recherche en Informatique et en Automatique, April 1998. http://coq.inria.fr/~dowek/RR-3400.ps.gz.
9. DW98. G. Dowek and B. Werner. Proof normalization modulo. Rapport de Recherche 3542, Institut National de Recherche en Informatique et en Automatique, November 1998. http://coq.inria.fr/~dowek/RR-3542.ps.gz.
10. Gir70. J.-Y. Girard. Une extension de l'interprétation de Gödel à l'analyse et son application à l'élimination des coupures dans l'analyse et la théorie des types. In J.E. Fenstad (Ed.), Second Scandinavian Logic Symposium. North-Holland, 1970.
11. Gir72. J.-Y. Girard. Interprétation fonctionnelle et élimination des coupures dans l'arithmétique d'ordre supérieur. PhD thesis, Paris VII, 1972.
12. Hue72. G. Huet. Constrained Resolution: A Complete Method for Type Theory. PhD thesis, Case Western Reserve University, 1972.
13. Hue73. G. Huet. The undecidability of unification in third order logic. Information and Control, 22:257-267, 1973.
14. JK86. J.-P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal of Computing, 15(4):1155-1194, 1986.
15. Preliminary version in Proceedings 11th ACM Symposium on Principles of Programming Languages, Salt Lake City (USA), 1984.
16. KR97. C. Kirchner and C. Ringeissen. Higher-Order Equational Unification via Explicit Substitutions. In Proceedings 6th International Joint Conference ALP'97-HOA'97, Southampton (UK), volume 1298 of Lecture Notes in Computer Science, pages 61-75. Springer-Verlag, 1997.
17. KvOvR93. J. Klop, V. van Oostrom, and F. van Raamsdonk. Combinatory reduction systems: introduction and survey. Theoretical Computer Science, 121:279-308, 1993.
18. Mar94. C. Marché. Normalised rewriting and normalised completion. In S. Abramsky, editor, Proceedings 9th IEEE Symposium on Logic in Computer Science, Paris (France), pages 394-403, 1994.
19. Mil83. D. Miller. Proofs in higher order logic. PhD thesis, Carnegie Mellon University, 1983.
20. Mil87. D. Miller. A compact representation of proofs. Studia Logica, XLVI(4):347-370, 1987.
21. Plo72. G. Plotkin. Building-in equational theories. Machine Intelligence, 7:73-90, 1972.
22. PS81. G. Peterson and M. Stickel. Complete sets of reductions for some equational theories. Journal of the ACM, 28:233-264, 1981.
23. Sti85. M. Stickel. Automated deduction by theory resolution. Journal of Automated Reasoning, 1(4):285-289, 1985.
24. Vir95. P. Viry. Rewriting modulo a rewrite system. Technical report TR-20/95, Dipartimento di informatica, Università di Pisa, December 1995.
25. Vir98. P. Viry. Adventures in sequent calculus modulo equations. In C. Kirchner and H. Kirchner, editors, Proceedings of the 2nd International Workshop on Rewriting Logic and its Applications, WRLA'98, volume 15, Pont-à-Mousson (France), September 1998. Electronic Notes in Theoretical Computer Science.