Paradigm Functional programming, Imperative programming Microsoft Research 2013; 9 years ago 3.48.0 / 17 September 2022; 3 months ago 4.0.0-m5 / 7 August 2022; 4 months ago Static, strong, inferred C++, Lean Cross-platform Apache License 2.0 Stable: leanprover-community.github.io Preview: leanprover.github.io MLCoqHaskell

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 that differentiates it from other interactive theorem provers. Lean can be compiled to JavaScript and accessed in a web browser. It has native support for Unicode symbols. (These can be typed using LaTeX-like sequences, such as "\times" for "×".) Lean also has an extensive support for meta-programming.

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.

## Examples

Here is how the natural numbers are defined in Lean.

inductive nat : Type
| zero : nat
| succ : nat → nat


Here is the addition operation defined for natural numbers.

definition add : nat → nat → nat
| n zero     := n
| n (succ m) := succ(add n m)


This is a simple proof in lean in term mode.

theorem and_swap : p ∧ q → q ∧ p :=
assume h1 : p ∧ q,
⟨h1.right, h1.left⟩


This same proof can be accomplished using tactics.

theorem and_swap (p q : Prop) : p ∧ q → q ∧ p :=
begin
assume h : (p ∧ q), -- assume p ∧ q is true
cases h, -- extract the individual propositions from the conjunction
split, -- split the goal conjunction into two cases: prove p and prove q separately
repeat { assumption }
end