robsimmons / abbot
Generation of abstract binding trees
☆26Updated 2 weeks ago
Related projects: ⓘ
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- ☆28Updated 9 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Miller/pattern unification in Agda☆62Updated 10 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- Automatically exported from code.google.com/p/trellys☆45Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆10Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- ☆20Updated 6 years ago
- being an experiment with potato power☆23Updated 4 years ago
- ☆82Updated 7 years ago
- System F in coq.☆19Updated 9 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆28Updated 3 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- Two-Level Type Theory☆27Updated 4 years ago
- STLC-related snippets in Agda☆15Updated 11 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
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A collection of mechanised proofs☆16Updated 4 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago