jsiek / abstract-binding-trees
Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
☆75Updated 4 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
- Formalizations of Gradually Typed Languages in Agda☆57Updated last month
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- A TACtic library for Agda☆48Updated 6 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 6 months ago
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- ☆47Updated 4 months ago
- Documentation on goals of the coq-community organization, the shared contributing guide and code of conduct.☆68Updated 10 months ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- A work-in-progress core language for Agda, in Agda☆46Updated last week
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆56Updated 6 months ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- ☆36Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆94Updated last month
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- ☆84Updated 7 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆123Updated 9 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- 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
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated 2 weeks ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- ☆29Updated last year
- being bits and pieces I'm inclined to leave lying around☆49Updated 3 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago