robsimmons / abbotLinks
Generation of abstract binding trees
☆28Updated 10 months ago
Alternatives and similar repositories for abbot
Users that are interested in abbot are comparing it to the libraries listed below
Sorting:
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- ☆29Updated 9 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆21Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 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
- ☆84Updated 7 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 months ago
- Two-Level Type Theory☆28Updated 5 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- The Alms Programming Language☆44Updated 6 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- Web based opetopic editor☆35Updated 10 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 8 months ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Selective applicative functors laws and theorems☆14Updated 5 years ago