Skip to main content
SpringerLink
Log in

System description: Leo — A higher-order theorem prover

  • Conference paper
  • First Online:
Automated Deduction — CADE-15 (CADE 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1421))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Article  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  3. C. Benzmüller and M. Kohlhase. Extensional Higher-Order Resolution. Proc. CADE-15, this volume, 1998.

    Google Scholar 

  4. P. Graf. Term Indexing. Number 1053 in LNCS. Springer Verlag, 1996.

    Google Scholar 

  5. X. Huang, M. Kerber, M. Kohlhase, E. Melis, D. Nesmith, J. Richts, and J. Siekmann. Keim: A toolkit for automated deduction. In Alan Bundy, editor, Proc. CADE-13, number 814 in LNAI, pages 807–810, 1994. Springer Verlag.

    Google Scholar 

  6. G. P. Huet. An unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27–57, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  7. L. Klein. Indexing für Terme höherer Stufe. Master's thesis, FB Informatik, UniversitÄt des Saarlandes, 1997.

    Google Scholar 

  8. M. Kohlhase. A Mechanization of Sorted Higher-Order Logic Based on the Resolution Principle. PhD thesis, UniversitÄt des Saarlandes, 1994.

    Google Scholar 

  9. D. Miller. Unification under a mixed prefix. Journal of Symbolic Computation, 14:321–358, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  10. Z. Trybulec and H. Swieczkowska. Boolean properties of sets. Journal of Formalized Mathematics, 1, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, UniversitÄt des Saarlandes, Germany

    Christoph Benzmüller & Michael Kohlhase

Authors
  1. Christoph Benzmüller
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Kohlhase
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Claude Kirchner Hélène Kirchner

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benzmüller, C., Kohlhase, M. (1998). System description: Leo — A higher-order theorem prover. In: Kirchner, C., Kirchner, H. (eds) Automated Deduction — CADE-15. CADE 1998. Lecture Notes in Computer Science, vol 1421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054256

Download citation

  • DOI: https://doi.org/10.1007/BFb0054256

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64675-4

  • Online ISBN: 978-3-540-69110-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation