sorear / smetamath-rsLinks
sorear's Metamath system engine - version 3 Rust
☆24Updated 2 years ago
Alternatives and similar repositories for smetamath-rs
Users that are interested in smetamath-rs are comparing it to the libraries listed below
Sorting:
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆34Updated 3 months ago
- A type checker for the Lean theorem prover☆40Updated 4 years ago
- Rust bindings for the Lean 4 proof assistant☆38Updated 6 months ago
- Automatically exported from code.google.com/p/ghilbert☆48Updated 7 years ago
- An encyclopedia of proofs☆61Updated 9 months ago
- A formal consistency proof of Quine's set theory New Foundations☆73Updated 2 months ago
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆38Updated last month
- Specification of the Cedille Core language☆32Updated 5 years ago
- Extra and extended datatypes for Lean 4☆11Updated 2 years ago
- Lean type-checker written in Scala.☆36Updated 3 years ago
- A WebAssembly implementation in Lean4☆34Updated last year
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Alternative implementation of the logical framework Dedukti in Rust☆22Updated 4 months ago
- Human-like theorem prover, inspired by robotone and developed in the Coq ecosystem.☆17Updated 3 years ago
- Library implementing type inference/checking functionality based on the Lean theorem prover☆70Updated 2 months ago
- Real number computation software☆126Updated 3 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
- Plain-text declaration export for Lean 4☆19Updated 2 months ago
- Mathematical learnings with Lean, for those of us who wish we knew more of both!☆10Updated 3 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Exploration of primes, factorization and number theory through haskell☆10Updated 8 years ago
- The Steel separation logic library for F*☆36Updated 2 weeks ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 weeks ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 10 years ago
- ☆13Updated 3 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆52Updated 2 months ago
- Slides and handwritten notes on the course on models of programming languages☆51Updated 4 years ago
- An automated theorem prover for first order logic.☆29Updated 8 years ago
- A formalization of M-types in Agda☆35Updated 5 years ago
- A Rust implementation of the Lean kernel☆12Updated 2 years ago