jsiek / abstract-binding-treesLinks
Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
☆79Updated 3 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 this week
- 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
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- HoTT in Lean 3☆82Updated 5 years ago
- A TACtic library for Agda☆50Updated last year
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A tutorial on how Agda infers things☆63Updated 5 months ago
- Lecture notes on realizability☆75Updated 10 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆84Updated 4 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- Benchmarks for capture-avoiding substitution☆121Updated 6 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- An interactive theorem prover based on lambda-tree syntax☆98Updated 3 weeks ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆84Updated 9 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 3 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆113Updated 4 months ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- ☆84Updated 8 years ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- An enhanced unification algorithm for Coq☆58Updated 3 weeks ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- Where my everyday research happens☆55Updated last month
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- ☆51Updated 4 months ago
- ☆36Updated 4 years ago