robsimmons / abbot
Generation of abstract binding trees
☆27Updated 2 months ago
Alternatives and similar repositories for abbot:
Users that are interested in abbot are comparing it to the libraries listed below
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated last month
- ☆29Updated 9 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆11Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- System F in coq.☆19Updated 9 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- A prototype implementation of the Frank programming language☆17Updated 8 years ago
- being an experiment with potato power☆23Updated 5 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆48Updated last month
- Miller/pattern unification in Agda☆63Updated 10 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- ☆20Updated 6 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- ☆84Updated 7 years ago
- A Dependently Typed Programming Language☆27Updated 4 years ago
- The Alms Programming Language☆44Updated 6 years ago
- A collection of mechanised proofs☆16Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago