digama0 / mm-lean4Links
Lean 4 Metamath verifier
☆21Updated 2 weeks ago
Alternatives and similar repositories for mm-lean4
Users that are interested in mm-lean4 are comparing it to the libraries listed below
Sorting:
- Datatypes as quotients of polynomial functors☆39Updated 5 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆54Updated last month
- The formal proof of the Odd Order Theorem☆37Updated last month
- HoTT in Lean 3☆82Updated 5 years ago
- Code samples for Lean 4☆77Updated 2 years ago
- Lean4 port of Arduino balance car controller☆48Updated 4 years ago
- M4 algebraic geometry course in Lean☆58Updated 5 years ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆71Updated last year
- Implementation of higher-order logic in Python☆66Updated 2 years ago
- ☆36Updated 4 years ago
- Algebraic Combinatorics in Coq☆39Updated 2 months ago
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆39Updated 3 weeks ago
- A formal consistency proof of Quine's set theory New Foundations☆76Updated 6 months ago
- ☆42Updated 7 months ago
- A formal proof of the irrationality of zeta(3), the Apéry constant [maintainer=@amahboubi,@pi8027]☆25Updated 3 months ago
- A LaTeX package to reproduce (an enhanced version of) the numbered paragraph style from classic French mathematics books.☆19Updated 4 years ago
- Python bindings for the Coq interactive proof assistant☆57Updated 3 years ago
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- Lean type-checker written in Scala.☆40Updated 3 years ago
- Schemes in Lean (v2)☆44Updated 5 years ago
- Topos theory in lean☆64Updated 4 years ago
- Hoare Type Theory☆84Updated 6 months ago
- The TacTok automated Coq proof script synthesis tool☆17Updated last year
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆37Updated 7 months ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆84Updated 4 years ago
- Automated Reasoning for the Working Mathematician☆11Updated 6 years ago
- Very controlled natural language tactics for Lean☆65Updated last year
- maze game encoded in Lean 4 syntax☆66Updated 5 months ago
- A (formalised) general definition of type theories☆59Updated 4 years ago