Lean 4 fork for HoTT-compatible kernel extensions (Path types, transport, HITs). Maintained against upstream leanprover/lean4.
c3a1669398
This PR implements the main loop of the new commutative ring procedure in `grind`. In the main loop, for each polynomial `p` in the todo queue, the procedure: - Simplifies it using the current basis. - Computes critical pairs with polynomials already in the basis and adds them to the queue. After the queue is empty, the disequalities are re-simplified using the new basis. `grind` can now solve examples such as: ```lean example [CommRing α] (x y : α) : x*y*x = 1 → x*y*y = y → y = 1 := by grind +ring example [CommRing α] (x y : α) : x^2*y = 1 → x*y^2 = y → y*x = 1 := by grind +ring example (x y : BitVec 16) : x^2*y = 1 → x*y^2 = y → y*x = 1 := by grind +ring ``` |
||
|---|---|---|
| .github | ||
| doc | ||
| images | ||
| nix | ||
| releases_drafts | ||
| script | ||
| src | ||
| stage0 | ||
| tests | ||
| .gitattributes | ||
| .gitignore | ||
| .gitpod.Dockerfile | ||
| .gitpod.yml | ||
| .ignore | ||
| CMakeLists.txt | ||
| CMakePresets.json | ||
| 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
- Documentation Overview
- Language Reference
- 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).