robsimmons / abbotLinks
Generation of abstract binding trees
☆27Updated 10 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☆26Updated 10 years ago
- ☆29Updated 9 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 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
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Constructive Galois connections☆35Updated 7 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- ☆84Updated 8 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 5 months ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- Work in progress☆38Updated 3 months ago