A proof tree viewer that works with Coq through Proof General
☆28Jan 29, 2021Updated 5 years ago
Alternatives and similar repositories for traf
Users that are interested in traf are comparing it to the libraries listed below
Sorting:
- An encoding of linear logic in Coq with minimal Sokoban and blocks world examples☆22Feb 4, 2022Updated 4 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29May 26, 2021Updated 4 years ago
- ☆13Nov 23, 2019Updated 6 years ago
- OCaml implementation of DSub, a ML like language with subtyping and path dependent types.☆13Apr 18, 2017Updated 8 years ago
- ☆16Feb 18, 2025Updated last year
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Jan 14, 2019Updated 7 years ago
- Linearizability Hoare Logic☆17Feb 9, 2026Updated 3 weeks ago
- IO using sized types and copatterns☆36Apr 14, 2021Updated 4 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- Patricia Tree data structure in OCaml for maps and sets, supports generic (GADT) keys☆16Feb 9, 2026Updated 3 weeks ago
- Rocq RFCs: documents to discuss changes to the Rocq Prover☆60Jan 15, 2025Updated last year
- ☆15Apr 1, 2019Updated 6 years ago
- ☆15Aug 3, 2025Updated 7 months ago
- Mechanized Theory of Event Structures☆16Aug 16, 2023Updated 2 years ago
- Paper about polynomial functors, regular expressions, matrices of types, derivatives, semirings, and other cool stuff☆14Feb 13, 2018Updated 8 years ago
- Interpreter for λ̅μμ̃-calculus of Herbelin and Curien (for educational purposes).☆20Oct 8, 2020Updated 5 years ago
- Towards Optic-Based Algebraic Theories: the Case of Lenses☆17Nov 26, 2018Updated 7 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆28Sep 2, 2023Updated 2 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Feb 26, 2024Updated 2 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- A formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…☆24Updated this week
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51May 5, 2022Updated 3 years ago
- Calculus of Constructions☆17Jul 17, 2019Updated 6 years ago
- ☆16Apr 19, 2022Updated 3 years ago
- Coq library for handling names☆19Aug 5, 2022Updated 3 years ago
- ☆43Nov 2, 2018Updated 7 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Jun 3, 2022Updated 3 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated 2 weeks ago
- The Rocq Prover bot☆26Jan 30, 2026Updated last month
- Martin-Löf type theory + W-types implemented in C (WIP)☆27Feb 16, 2026Updated 2 weeks ago
- 🌋 Idris implementation of patricia tree☆23Nov 6, 2020Updated 5 years ago
- Constructive Galois connections☆36Mar 26, 2018Updated 7 years ago
- Setoid type theory implementation☆38Aug 24, 2023Updated 2 years ago
- Type-level rational puzzles in OCaml☆25Jun 8, 2016Updated 9 years ago