A port of miniprl to Haskell with co-/inductive types bolted on the side.
☆22May 13, 2016Updated 9 years ago
Alternatives and similar repositories for cha
Users that are interested in cha are comparing it to the libraries listed below
Sorting:
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Implementation of Nuprl's type theory in Coq☆47Feb 25, 2026Updated 3 weeks ago
- being the beginnings of at least zero typecheckers☆34Apr 13, 2017Updated 8 years ago
- An exploration and implementation of the lambda calculus.☆12Oct 18, 2016Updated 9 years ago
- TODO☆23Oct 10, 2015Updated 10 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- My PhD thesis, titled "Reasonably Programmable Syntax"☆15Aug 28, 2018Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated 2 months ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- Typed DSLs for sorting☆20Feb 16, 2018Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆58Mar 11, 2026Updated last week
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- "Toy" SMT Solver for Educational Purposes☆20Apr 17, 2013Updated 12 years ago
- System F in coq.☆19Jan 27, 2015Updated 11 years ago
- ☆26Feb 7, 2017Updated 9 years ago
- A playground for type theory implementations in Racket☆20Dec 2, 2015Updated 10 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 7 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- Abstract binding tree code generator☆37Oct 31, 2016Updated 9 years ago
- ☆11Jul 8, 2020Updated 5 years ago
- A collection of SML utility modules that are useful for compiler writing.☆11Dec 17, 2025Updated 3 months ago
- Research material of Erik Palmgren (1963–2019)☆21Apr 7, 2025Updated 11 months ago
- YUP is a proof checker that performs automatic checking of simple program-correctness proofs of functional programs through inductive and…☆36Feb 14, 2023Updated 3 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Jun 11, 2016Updated 9 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated last month
- my phd thesis☆26Aug 7, 2024Updated last year