jsiek / abstract-binding-treesLinks
Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
☆75Updated 8 months ago
Alternatives and similar repositories for abstract-binding-trees
Users that are interested in abstract-binding-trees are comparing it to the libraries listed below
Sorting:
- Formalizations of Gradually Typed Languages in Agda☆57Updated 5 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- A TACtic library for Agda☆48Updated 9 months ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- A tutorial on how Agda infers things☆58Updated this week
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- ☆48Updated last month
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 9 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- ☆36Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- ☆29Updated 2 years ago
- Benchmarks for capture-avoiding substitution☆119Updated last month
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- HoTT in Lean 3☆80Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Lecture notes on realizability☆74Updated 4 months ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 2 weeks ago
- Implementation of Nuprl's type theory in Coq☆45Updated 7 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- Denotational semantics based on graph and filter models☆23Updated 6 months ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago