Martin-Löf Extensible Specification and Simulator
☆29Jul 1, 2015Updated 10 years ago
Alternatives and similar repositories for mess
Users that are interested in mess are comparing it to the libraries listed below
Sorting:
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated this week
- scraps and bits and bobs☆13Jul 28, 2022Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- ☆17Apr 4, 2024Updated last year
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Mar 31, 2015Updated 10 years ago
- A language-generic implementation of equality saturation in Haskell☆22Dec 4, 2018Updated 7 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- ☆12May 9, 2015Updated 10 years ago
- Agda to C compiler☆10Sep 23, 2025Updated 5 months ago
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Jan 30, 2024Updated 2 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆77Jul 30, 2018Updated 7 years ago
- Collaborative work on reversible computing☆18Aug 3, 2022Updated 3 years ago
- Base library for HoTT in Agda☆39Apr 2, 2019Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Decision procedures for Presburger arithmetic in Haskell☆30Mar 29, 2025Updated 11 months ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Jul 19, 2025Updated 7 months ago
- mirror of A simple type-theoretic language: Mini-TT☆41Feb 15, 2017Updated 9 years ago
- The Cambridge Haskell Supercompiler: an extension of "Supercompilation by Evaluation"☆24Mar 30, 2011Updated 14 years ago
- Coq solutions to exercises in HoTT book☆12Jan 31, 2014Updated 12 years ago
- ☆12Jun 13, 2023Updated 2 years ago
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- Linearizability Hoare Logic☆17Feb 9, 2026Updated 3 weeks ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- A playground for type theory implementations in Racket☆20Dec 2, 2015Updated 10 years ago
- Idris Lib to interact with the DOM and Browser API for the JavaScript backend☆40Jan 15, 2018Updated 8 years ago
- A formalization of M-types in Agda☆36Mar 7, 2020Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- Typed DSLs for sorting☆20Feb 16, 2018Updated 8 years ago
- ☆15Oct 31, 2023Updated 2 years ago
- A DSL for generating GR(1) problems☆12Jul 27, 2021Updated 4 years ago
- Combinatorial species in HoTT☆12May 23, 2015Updated 10 years ago