leanprover / theorem_proving_in_lean
Theorem proving in Lean
☆49Updated 6 months ago
Alternatives and similar repositories for theorem_proving_in_lean
Users that are interested in theorem_proving_in_lean are comparing it to the libraries listed below
Sorting:
- HoTT in Lean 3☆80Updated 4 years ago
- Schemes in Lean (v2)☆43Updated 4 years ago
- Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]☆115Updated 3 months ago
- A (formalised) general definition of type theories☆57Updated 3 years ago
- The formal proof of the Odd Order Theorem☆30Updated 3 weeks ago
- The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]☆70Updated 2 weeks ago
- An encyclopedia of proofs☆60Updated 6 months ago
- ☆31Updated last year
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- Formalising Type Theory in a modular way for translations between type theories☆94Updated 7 years ago
- Convert Haskell source code to Coq source code.☆85Updated 8 months ago
- A Probability Theory Library for the Coq Theorem Prover☆54Updated last year
- Finite sets, finite maps, multisets and generic sets☆48Updated 2 weeks ago
- ☆46Updated 2 years ago
- Notes on how to use the internal language of toposes in algebraic geometry☆57Updated 2 weeks ago
- Generates natural language versions of Coq proofs☆51Updated 7 years ago
- LaTeX code for a paper on lean's type theory☆132Updated 2 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
- Development tools for https://github.com/leanprover-community/mathlib☆34Updated last year
- Coq Protocol Playground with Se(xp)rialization of Internal Structures.☆130Updated 6 months ago
- Voevodsky's original development of the univalent foundations of mathematics in Coq☆54Updated 10 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 6 years ago
- Implementation of higher-order logic in Python☆65Updated 2 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 5 months ago
- Datatypes as quotients of polynomial functors☆35Updated 5 years ago
- A formalization of M-types in Agda☆32Updated 5 years ago
- A best-first-search theorem prover implemented in Isabelle☆34Updated 2 years ago
- collaboration on work in progress☆15Updated 14 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆82Updated 8 years ago
- ☆55Updated last month