robsimmons / abbotLinks
Generation of abstract binding trees
☆27Updated last month
Alternatives and similar repositories for abbot
Users that are interested in abbot are comparing it to the libraries listed below
Sorting:
- ☆29Updated 10 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 11 months ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Miller/pattern unification in Agda☆67Updated last week
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- A language-integrated proof assistant, for and in Racket☆39Updated 9 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
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Selective applicative functors laws and theorems☆14Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- ☆84Updated 8 years ago
- ☆47Updated 6 years ago
- A prototype implementation of the Frank programming language☆17Updated 9 years ago
- Luck -- A Language for Property-Based Generators☆35Updated 8 months ago