gebner / treppleinLinks
Lean type-checker written in Scala.
☆36Updated 3 years ago
Alternatives and similar repositories for trepplein
Users that are interested in trepplein are comparing it to the libraries listed below
Sorting:
- A Testing Framework for Lean☆59Updated last month
- A Seamless, Interactive Tactic Learner and Prover for Coq☆74Updated last month
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆38Updated 2 months ago
- A book about functional programming in Lean☆42Updated last year
- A Lean 4 library for iterators.☆12Updated last year
- Ground Zero: Lean 4 HoTT Library☆66Updated 3 weeks ago
- maze game encoded in Lean 4 syntax☆60Updated 2 months ago
- HoTT in Lean 3☆81Updated 5 years ago
- A cost-aware logical framework, embedded in Agda.☆66Updated this week
- LaTeX code for a paper on lean's type theory☆147Updated 3 years ago
- Reference type checker for the Lean theorem prover☆62Updated 8 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 11 months ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆51Updated 2 months ago
- Formalising the WASM spec in Lean☆23Updated last year
- Experiments with SAT solvers with proofs in Lean 4☆59Updated last year
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆68Updated 10 months ago
- Parser Combinator Library for Lean 4☆56Updated 3 weeks ago
- A prototype for a monadic program logic in Lean that has since been upstreamed into the Lean 4 repo☆37Updated 2 months ago
- Code samples for Lean 4☆77Updated last year
- A verified compiler for a lazy functional language☆37Updated last week
- Plain-text declaration export for Lean 4☆19Updated 3 months ago
- A toolkit for enforcing logical specifications on neural networks☆110Updated this week
- This package provides an interface and foundation for verified SAT reasoning☆54Updated last year
- A Lean 4 library for configuring Command Line Interfaces and parsing command line arguments.☆83Updated last week
- A formalization of M-types in Agda☆34Updated 5 years ago
- A formal consistency proof of Quine's set theory New Foundations☆73Updated 2 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated this week
- A toy example of a verified compiler.☆29Updated 4 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago