robsimmons / abbotLinks
Generation of abstract binding trees
☆28Updated 8 months ago
Alternatives and similar repositories for abbot
Users that are interested in abbot are comparing it to the libraries listed below
Sorting:
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- ☆29Updated 9 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- ☆21Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Constructive Galois connections☆32Updated 7 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- The Evolution of a Typechecker☆54Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 6 months ago