jsiek / abstract-binding-treesLinks
Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
☆80Updated 5 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☆59Updated last month
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- A tutorial on how Agda infers things☆63Updated 6 months ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated last week
- A TACtic library for Agda☆51Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- ☆52Updated 5 months ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆130Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- A formalized proof of a version of the initiality conjecture☆45Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- HoTT in Lean 3☆81Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Unification and type inference algorithms☆127Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Benchmarks for capture-avoiding substitution☆122Updated 8 months ago
- Lecture notes on realizability☆75Updated 11 months ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Updated 6 months ago
- Paper and talk☆55Updated 2 years ago
- Where my everyday research happens☆55Updated this week
- A (formalised) general definition of type theories☆59Updated 4 years ago
- # A simple variable binding library based on well-scoped indices and environments☆29Updated 3 months ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆32Updated last week