jsiek / abstract-binding-trees
Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
☆74Updated 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
- A TACtic library for Agda☆48Updated 5 months ago
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 2 weeks ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- ☆36Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆122Updated 8 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆54Updated 5 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- Documentation on goals of the coq-community organization, the shared contributing guide and code of conduct.☆68Updated 9 months ago
- An interactive theorem prover based on lambda-tree syntax☆92Updated 3 weeks 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
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Parser Combinator Library for Lean 4☆46Updated 2 weeks ago
- ☆47Updated 2 months ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- This aims to be the most pretentious implementation of stlc in existence☆61Updated 2 years ago
- An enhanced unification algorithm for Coq☆53Updated 2 weeks ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- Lecture notes on realizability☆67Updated 4 months ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated 3 weeks ago
- Where my everyday research happens☆52Updated last week
- Unification and type inference algorithms☆124Updated 10 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- high-performance cubical evaluation☆69Updated 2 months ago