Authors
Jeremy Avigad
Carnegie Mellon University
Abstract
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 65,599
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Maddy On The Multiverse.Claudio Ternullo - 2019 - In Deniz Sarikaya, Deborah Kant & Stefania Centrone (eds.), Reflections on the Foundations of Mathematics. Berlin: Springer Verlag. pp. 43-78.

Add more citations

Similar books and articles

Foundations of a Theorem Prover for Functional and Mathematical Uses.Javier Leach & Susana Nieva - 1993 - Journal of Applied Non-Classical Logics 3 (1):7-38.
Implementing a Relational Theorem Prover for Modal Logic K.Angel Mora, Emilio Munoz Velasco & Joanna Golińska-Pilarek - 2011 - International Journal of Computer Mathematics 88 (9):1869-1884.
Metamathematics, Machines and Gödel's Proof.N. Shankar - 1994 - Cambridge University Press.

Analytics

Added to PP index
2016-01-12

Total views
91 ( #121,732 of 2,462,162 )

Recent downloads (6 months)
1 ( #449,335 of 2,462,162 )

How can I increase my downloads?

Downloads

My notes