robsimmons / abbotLinks
Generation of abstract binding trees
☆27Updated 4 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
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- ☆29Updated 10 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Constructive Galois connections☆36Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Miller/pattern unification in Agda☆67Updated 3 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 10 months ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 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
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Two-Level Type Theory☆28Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- being an experiment with potato power☆23Updated 6 years ago
- ☆21Updated 7 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 4 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 8 years ago