ichistmeinname / free-provingView external linksLinks
Resources for "One Monad to Prove Them All"
☆29Dec 31, 2018Updated 7 years ago
Alternatives and similar repositories for free-proving
Users that are interested in free-proving are comparing it to the libraries listed below
Sorting:
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Dec 14, 2016Updated 9 years ago
- a version of the 2048 game for Coq☆22Jan 30, 2026Updated 2 weeks ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- My final year project at the University of Strathclyde☆13Jan 26, 2023Updated 3 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Apr 11, 2025Updated 10 months ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Calculus of Constructions☆17Jul 17, 2019Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 7 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Dec 15, 2016Updated 9 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Oct 26, 2023Updated 2 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29May 26, 2021Updated 4 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Jul 24, 2019Updated 6 years ago
- proof script associated to tutorial material☆17Oct 29, 2023Updated 2 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Jun 10, 2025Updated 8 months ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Jan 25, 2013Updated 13 years ago
- "Programs that explain their effects" talk material☆17Jun 22, 2018Updated 7 years ago
- Towards Optic-Based Algebraic Theories: the Case of Lenses☆17Nov 26, 2018Updated 7 years ago
- A Self-Interpreter for F-omega☆16Dec 6, 2015Updated 10 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51May 5, 2022Updated 3 years ago
- Idris, but it's C☆24May 25, 2018Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Jan 11, 2026Updated last month
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.☆18Oct 12, 2018Updated 7 years ago
- Fully proved small C functions (examples for verification course).☆17Jun 26, 2017Updated 8 years ago