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:
- ☆29Updated 10 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A simple implementation of linear type theory☆39Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Constructive Galois connections☆36Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- ☆86Updated 8 years ago
- ☆21Updated 7 years ago
- Miller/pattern unification in Agda☆68Updated 3 months ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years 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
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- being an experiment with potato power☆23Updated 6 years ago
- Two-Level Type Theory☆28Updated 6 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 8 months ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- ☆48Updated 6 years ago
- A dynamically-typed CBPV language embedded in Racket☆40Updated last year