The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
The Lean Theorem Prover (System Description)
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
(2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45949-9 · Cited by 1,629
PVS: A prototype verification system
Owre, S., Rushby, J. M., & Shankar, N. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-55602-8_217 · Cited by 1,415
Springer Science and Business Media
Montenarie, W. (2004) · The Library of Electronic Cyprus Thematic Organized Collections (LYKYTHOS) (University of Cyprus) · Cited by 1,402
Martin-Löf, P. (1984) · Bibliopolis eBooks · Cited by 1,274
Coquand, T., & Huet, G. (1988) · Information and Computation · doi:10.1016/0890-5401(88)90005-3 · Cited by 1,082
The Coq Proof Assistant - Reference Manual Version 6.1
Filliâtre, J.-C., Herbelin, H., Barras, B., Boutin, S., Giménez, E., Huet, G., Munoz, C. A., Cornes, C., Cornes, C., Courant, J., et al. (1997) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 979
Coquand, T., & Paulin-Mohring, C. (1990) · Lecture notes in computer science · doi:10.1007/3-540-52335-9_47 · Cited by 287
Programming with Higher-Order Logic
Miller, D., & Nadathur, G. (2012) · Cambridge University Press eBooks · doi:10.1017/cbo9781139021326 · Cited by 149
Isabelle/Isar --- a versatile environment for human-readable formal proof documents
Wenzel, M. (2002) · Cited by 133
Cited by
The Lean 4 Theorem Prover and Programming Language
Moura, L. D., & Ullrich, S. (2021) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-79876-5_37 · Cited by 258
Self-citationSTaR: Bootstrapping Reasoning With Reasoning
Zelikman, E., Wu, Y., Mu, J., & Goodman, N. D. (2022) · arXiv · doi:10.48550/arxiv.2203.14465 · Cited by 182
Logic-LM: Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoning
Pan, L., Albalak, A., Wang, X., & Wang, W. Y. (2023) · arXiv · doi:10.48550/arxiv.2305.12295 · Cited by 144
“These works demonstrate the proficiency of LLMs in translating a considerable fraction of mathematical problems into formal specifications defined in tools like SymPy (Meurer et al., 2017), Isabelle/HOL (Paulson, 1994), and Lean (de Moura et al., 2015).”
BackgroundMethodINT: An Inequality Benchmark for Evaluating Generalization in Theorem Proving
Wu, Y., Jiang, A. Q., Ba, J., & Grosse, R. (2020) · arXiv · doi:10.48550/arxiv.2007.02924 · Cited by 30
Maintaining a Library of Formal Mathematics
van Doorn, F., Ebner, G., & Lewis, R. Y. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-53518-6_16 · Cited by 29
Self-citation
Metadata
- Authors
- de Moura, L., Kong, S., Avigad, J., van Doorn, F., & von Raumer, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2015
- Pages
- 378-388
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1464569014
- Cited by
- 416
- References
- 12
- FWCI
- 9.85
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Lean Theorem Prover (System Description). https://app.cochat.ai/papers/10.1007/978-3-319-21401-6_26
- The paper
- de Moura, L., Kong, S., Avigad, J., van Doorn, F., & von Raumer, J. (2015). The Lean Theorem Prover (System Description). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-21401-6_26
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
