The Lean theorem prover (system description).

*(English)*Zbl 1465.68279
Felty, Amy P. (ed.) et al., Automated deduction – CADE-25. 25th international conference on automated deduction, Berlin, Germany, August 1–7, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9195, 378-388 (2015).

Summary: Lean is a new open source theorem prover being developed at Microsoft Research and Carnegie Mellon University, with a small trusted kernel based on dependent type theory. It aims to bridge the gap between interactive and automated theorem proving, by situating automated tools and methods in a framework that supports user interaction and the construction of fully specified axiomatic proofs. Lean is an ongoing and long-term effort, but it already provides many useful components, integrated development environments, and a rich API which can be used to embed it into other systems. It is currently being used to formalize category theory, homotopy type theory, and abstract algebra. We describe the project goals, system architecture, and main features, and we discuss applications and continuing work.

For the entire collection see [Zbl 1316.68011].

For the entire collection see [Zbl 1316.68011].

##### MSC:

68V15 | Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) |

68V20 | Formalization of mathematics in connection with theorem provers |

PDF
BibTeX
XML
Cite

\textit{L. de Moura} et al., Lect. Notes Comput. Sci. 9195, 378--388 (2015; Zbl 1465.68279)

Full Text:
DOI

**OpenURL**

##### References:

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.