Lean 4 fork for HoTT-compatible kernel extensions (Path types, transport, HITs). Maintained against upstream leanprover/lean4.
in #4158 I was experimenting with a change to the simplifier that affectes the order in which lemmas were tried, and of course it breaks proofs all over the place whenever we have a non-confluent simp set. Among the first breakages encountered, a large fraction was due to `simp` rewriting with `List.length_pos : 0 < length l ↔ l ≠ []`. This does not strike me a as a good simp lemma: If `l` is a manifest constructor, the simplifier will reduce `length` and solve it anyways, and if it isn't then an inequality usually isn’t very simp friendly. It is also highly non-confluent with any kind of `length`-lemma we might have. This therefore removes it from the standard simp set. |
||
|---|---|---|
| .github | ||
| doc | ||
| images | ||
| nix | ||
| script | ||
| src | ||
| stage0 | ||
| tests | ||
| .gitattributes | ||
| .gitignore | ||
| .ignore | ||
| CMakeLists.txt | ||
| CODEOWNERS | ||
| CONTRIBUTING.md | ||
| flake.lock | ||
| flake.nix | ||
| lean-toolchain | ||
| lean.code-workspace | ||
| LICENSE | ||
| LICENSES | ||
| README.md | ||
| RELEASES.md | ||
This is the repository for Lean 4.
About
- Quickstart
- Homepage
- Theorem Proving Tutorial
- Functional Programming in Lean
- Manual
- Release notes starting at v4.0.0-m3
- Examples
- External Contribution Guidelines
- FAQ
Installation
See Setting Up Lean.
Contributing
Please read our Contribution Guidelines first.
Building from Source
See Building Lean (documentation source: doc/make/index.md).