01mf02 / kontroli-rs
Alternative implementation of the logical framework Dedukti in Rust
☆20Updated last week
Related projects ⓘ
Alternatives and complementary repositories for kontroli-rs
- Dependently typed lambda calculus - A Simple Proof Assistant☆11Updated 4 years ago
- Finite sets and maps for Coq with extensional equality☆29Updated last year
- Tiny verified SAT-solver☆28Updated 2 years ago
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆32Updated 2 months ago
- Formal Semantics for Why3☆14Updated this week
- Coq Enhancement Proposals☆49Updated 2 weeks ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆59Updated last week
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆33Updated last year
- Verifying encodings into propositional logic in Lean☆12Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Unofficial repository for the experimental porting of mathlib into lean4☆10Updated 3 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆26Updated 2 years ago
- Coq library for tactics, basic definitions, sets, maps☆42Updated last week
- Probabilistic separation logics for verifying higher-order probabilistic programs.☆17Updated this week
- Companion Coq development for Xavier Leroy's 2021 lectures on program logics☆40Updated 3 years ago
- The Steel separation logic library for F*☆31Updated last month
- A library for verifying graph-manipulating programs. Powered by Coq and VST. Compatible with CompCert.☆17Updated 2 weeks ago
- Lenses in Coq☆16Updated 2 years ago
- ☆13Updated last year
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆24Updated 10 months ago
- Stable sort algorithms and their stability proofs in Coq☆22Updated 2 months ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- Deadlock freedom by type checking☆19Updated last year
- Coq formalization of algorithms due to Tarjan and Kosaraju for finding strongly connected graph components using Mathematical Components …☆13Updated last year
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- ♾️ A library for universe levels and universe polymorphism☆33Updated last week
- Work in progress on semi-simplicial types☆23Updated last year
- PL syntax macros.☆17Updated 3 weeks ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆14Updated last year
- ☆12Updated 2 years ago
- ☆22Updated 8 years ago