robsimmons / abbot
Generation of abstract binding trees
☆28Updated 5 months ago
Alternatives and similar repositories for abbot:
Users that are interested in abbot are comparing it to the libraries listed below
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- ☆29Updated 9 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- System F in coq.☆19Updated 10 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Coq proof for the paper "Compiling a Fifty Year Journey"☆13Updated 7 years ago
- ☆21Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Tiny type-checker with dependent types☆77Updated 11 years ago
- Type theory in type theory☆16Updated 13 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 2 years ago
- Higher-order FRP compiler☆14Updated 3 years ago