Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.
Concept
Lean (proof assistant)
Summary
Lean is a theorem prover and programming language. It is based on the calculus of constructions with inductive types.
The Lean project is an open-source project hosted on GitHub. It was launched by Leonardo de Moura at Microsoft Research in 2013.
Lean has an interface, implemented as a Visual Studio Code extension and Language Server Protocol server, that differentiates it from other interactive theorem provers. It has native support for Unicode symbols, which can be typed using LaTeX-like sequences, such as "\times" for "×". Lean can also be compiled to JavaScript and accessed in a web browser and has extensive support for meta-programming.
Started in 2017, the user-maintained library mathlib contains the largest collection of mathematics that has been formalized in Lean. As of February 2023, mathlib contains over 100,000 theorems and 1,000,000 lines of code.
In prior releases of Lean, several core parts of the system's logic were not amenable to being modified. A user wishing to change these parts of the system would need to modify the C++ implementation of Lean. Furthermore, overhead associated with virtual machine interpretation meant that the efficiency of Lean was not competitive with other proof assistants such as Coq. In 2021, Leonardo de Moura and Sebastian Ullrich released Lean 4: a reimplementation of the Lean theorem prover within itself, with the aim of addressing the two aforementioned criticisms. Lean 4 produces C code which is then compiled, enabling the development of efficient domain-specific automation. Lean 4 is not backwards-compatible with Lean 3.
Lean has gotten attention from mathematicians Thomas Hales and Kevin Buzzard. Hales is using it for his project, Formal Abstracts. Buzzard uses it for the Xena project. One of the Xena Project's goals is to rewrite every theorem and proof in the undergraduate math curriculum of Imperial College London in Lean.
The natural numbers can be defined as an inductive type. This definition is based on the Peano axioms and states that every natural number is either zero or the successor of some other natural number.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.