jsiek / abstract-binding-treesLinks
Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
☆75Updated 7 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:
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A tutorial on how Agda infers things☆42Updated 4 years ago
- A TACtic library for Agda☆48Updated 9 months ago
- ☆84Updated 7 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 9 months ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 4 months ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Where my everyday research happens☆53Updated last week
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 2 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 8 years ago
- An enhanced unification algorithm for Coq☆56Updated 2 months ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- ☆36Updated 3 years ago
- Mechanizations of Type Theories☆30Updated 2 weeks ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated last month
- ☆29Updated 2 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 6 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Paper and talk☆54Updated last year