System description: Leo— A higher-order theorem prover

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

Volumn 1421, Issue , 1998, Pages 139-143

  Benzmüller, Christoph ^a   Kohlhase, Michael ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84872799915     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054256     Document Type: Conference Paper

References (10)

1. P.B. Andrews, M. Bishop, S. Issar, D. Nesmith, F. Pfenning, and H. Xi. TPS: A theorem proving system for classical type theory. Journal of Automated Reasoning, 16(3): 321-353, 1996.
2. C. Benzmüller. A Calculus and a System Architecture for Extensional Higher-Order Resolution. Research Report 97-198, Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, USA, June 1997.
3. C. Benzmüller and M. Kohlhase. Extensional Higher-Order Resolution. Proc. CADE-15, this volume, 1998.
4. P. Graf. Term Indexing. Number 1053 in LNCS. Springer Verlag, 1996.
5. X. Huang, M. Kerber, M. Kohlhase, E. Melis, D. Nesmith, J. Riehts, and J. Siek-mann. Keim: A toolkit for automated deduction. In Alan Bundy, editor, Proc. CADE-13, number 814 in LNAI, pages 807-810, 1994. Springer Verlag.
6. G.P. Huet. An unification algorithm for typed λ-calculus. Theoretical Computer Science, 1: 27-57, 1975.
7. L. Klein. Indexing für Terme höherer Stufe. Master's thesis, FB Informatik, Universität des Saarlandes, 1997.
8. M. Kohlhase. A Mechanization of Sorted Higher-Order Logic Based on the Resolution Principle. PhD thesis, Universität des Saarlandes, 1994.
9. D. Miller. Unification under a mixed prefix. Journal of Symbolic Computation, 14: 321-358, 1992.
10. Z. Trybulec and H. Swieczkowska. Boolean properties of sets. Journal of Formalized Mathematics, 1, 1989.