A collection of mechanised proofs
☆19Feb 4, 2020Updated 6 years ago
Alternatives and similar repositories for proofs
Users that are interested in proofs are comparing it to the libraries listed below
Sorting:
- Groupoids vs 1-Types☆11Nov 8, 2018Updated 7 years ago
- Hakyll support for Agda literate files☆19Jul 20, 2021Updated 4 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- ☆20Aug 13, 2024Updated last year
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Sep 21, 2022Updated 3 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Type theory + whales and syntax☆11Nov 28, 2019Updated 6 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- A http client for Idris based on libcurl☆10Mar 18, 2016Updated 9 years ago
- ☆30Jun 7, 2014Updated 11 years ago
- Generation of abstract binding trees☆27Sep 26, 2025Updated 5 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year
- Another implementation of Frank.☆70Jul 14, 2017Updated 8 years ago
- An experimental Haskell library for programming with effectful runners.☆30Dec 6, 2019Updated 6 years ago
- Template repo for theorem proving in Liquid Haskell☆32Sep 19, 2018Updated 7 years ago
- Notes and handouts from OPLSS 2018☆55Jul 23, 2018Updated 7 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- https://metaborg.github.io/mj.agda/☆13Oct 14, 2020Updated 5 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- A Coq to Cedille compiler written in Coq☆34Sep 22, 2020Updated 5 years ago
- TeX files for summary of category theory☆15Apr 9, 2016Updated 9 years ago
- being a particular fragment of Haskell, extended to a proof system☆44Updated this week
- Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.☆18Oct 12, 2018Updated 7 years ago
- Conference on Homotopy Type Theory 2019☆16Sep 18, 2019Updated 6 years ago
- Collaborative work on reversible computing☆25Oct 30, 2021Updated 4 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 library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Feb 13, 2018Updated 8 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- ☆21Jan 24, 2022Updated 4 years ago
- Keynote talk for Lambda Jam 2017 in Sydney☆20Sep 16, 2018Updated 7 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- being some experiments, working towards some equipment I wish I had☆37Feb 3, 2016Updated 10 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Aug 25, 2025Updated 6 months ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- Directed type theory for formal category theory☆17Apr 7, 2017Updated 8 years ago