jsiek / abstract-binding-trees
Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
☆75Updated 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
- A TACtic library for Agda☆48Updated 7 months ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆124Updated 10 months ago
- ☆36Updated 3 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 2 months ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 7 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆57Updated 6 months ago
- An enhanced unification algorithm for Coq☆55Updated this week
- high-performance cubical evaluation☆71Updated 4 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- A work-in-progress core language for Agda, in Agda☆47Updated 3 weeks ago
- This aims to be the most pretentious implementation of stlc in existence☆62Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- An interactive theorem prover based on lambda-tree syntax☆94Updated 2 months ago
- ☆29Updated last year
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- HoTT in Lean 3☆79Updated 4 years ago
- Implementation for ICFP 2020 paper☆50Updated 3 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- A formalisation of the Calculus of Constructions☆68Updated 8 months ago
- Mechanizations of Type Theories☆28Updated last month
- Paper and talk☆53Updated last year