digama0 / mm-lean4Links
Lean 4 Metamath verifier
☆20Updated 3 months ago
Alternatives and similar repositories for mm-lean4
Users that are interested in mm-lean4 are comparing it to the libraries listed below
Sorting:
- Code samples for Lean 4☆76Updated last year
- Lean4 port of Arduino balance car controller☆45Updated 4 years ago
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆52Updated 2 months ago
- HoTT in Lean 3☆80Updated 5 years ago
- ☆47Updated 2 years ago
- Lean type-checker written in Scala.☆36Updated 3 years ago
- ☆56Updated 4 months ago
- maze game encoded in Lean 4 syntax☆60Updated last month
- Python bindings for the Coq interactive proof assistant☆55Updated 3 years ago
- A formal proof of the irrationality of zeta(3), the Apéry constant [maintainer=@amahboubi,@pi8027]☆25Updated 2 months ago
- Specification of the Cedille Core language☆32Updated 5 years ago
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆34Updated 3 months ago
- Papers on aspects of Generalised Algebraic Theories, Contextual Categories and Mathematical Theory Of Data☆41Updated 2 months ago
- A formal consistency proof of Quine's set theory New Foundations☆73Updated 2 months ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆74Updated 3 weeks ago
- Algebraic Combinatorics in Coq☆38Updated 7 months ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆67Updated 10 months ago
- Implementation of books from Bourbaki's Elements of Mathematics in Coq [maintainer=@thery]☆31Updated 2 months ago
- Probabilistic separation logics for verifying higher-order probabilistic programs.☆26Updated this week
- A LaTeX package to reproduce (an enhanced version of) the numbered paragraph style from classic French mathematics books.☆19Updated 4 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆85Updated 4 years ago
- Very controlled natural language tactics for Lean☆64Updated last year
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆38Updated last month
- Pedagogical first-order prover in Python☆76Updated 2 months ago
- Coq library for verified low-level programming☆60Updated 8 years ago
- M4 algebraic geometry course in Lean☆58Updated 5 years ago
- Implementation of higher-order logic in Python☆65Updated 2 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 8 months ago