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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Hakyll support for Agda literate files☆19Jul 20, 2021Updated 4 years ago
- Groupoids vs 1-Types☆11Nov 8, 2018Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- ☆12Jan 25, 2022Updated 4 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 4 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year
- Generation of abstract binding trees☆27Sep 26, 2025Updated 5 months ago
- A http client for Idris based on libcurl☆10Mar 18, 2016Updated 10 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Another implementation of Frank.☆70Jul 14, 2017Updated 8 years ago
- A Coq to Cedille compiler written in Coq☆34Sep 22, 2020Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- Type theory + whales and syntax☆11Nov 28, 2019Updated 6 years ago
- TeX files for summary of category theory☆15Apr 9, 2016Updated 9 years ago
- An experimental Haskell library for programming with effectful runners.☆30Dec 6, 2019Updated 6 years ago
- 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
- Notes and handouts from OPLSS 2018☆55Jul 23, 2018Updated 7 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- SubML (prototype) language☆22Mar 20, 2022Updated 4 years ago
- being some experiments, working towards some equipment I wish I had☆37Feb 3, 2016Updated 10 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click and start building anything your business needs.
- experiments with pext/pdep and codebruijn syntax☆17Nov 17, 2019Updated 6 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Mar 2, 2026Updated 3 weeks ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- PL syntax macros.☆21Updated this week
- ☆20Aug 13, 2024Updated last year
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Implementation of Nuprl's type theory in Coq☆47Feb 25, 2026Updated last month
- 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
- ☆21Jan 24, 2022Updated 4 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 4 months ago
- Template repo for theorem proving in Liquid Haskell☆33Sep 19, 2018Updated 7 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆146Mar 29, 2019Updated 6 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Directed type theory for formal category theory☆17Apr 7, 2017Updated 8 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Aug 25, 2025Updated 7 months ago