jsiek / abstract-binding-trees
Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
☆69Updated 3 weeks ago
Related projects: ⓘ
- A TACtic library for Agda☆48Updated this week
- Formalizations of Gradually Typed Languages in Agda☆54Updated 2 weeks ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆51Updated 2 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆50Updated this week
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- ☆35Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated last year
- A tutorial on how Agda infers things☆33Updated 3 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆80Updated 2 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- high-performance cubical evaluation☆67Updated 2 months ago
- A Unifying Cartesian Cubical Set Model☆33Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆60Updated last year
- An interactive theorem prover based on lambda-tree syntax☆89Updated 3 weeks ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆121Updated 3 months ago
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago
- A non-interactive proof assistant using the Haskell type system☆35Updated 4 years ago
- Set up a specific version of Agda for your GitHub Actions workflow.☆26Updated 3 weeks ago
- A (formalised) general definition of type theories☆56Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 3 months ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆32Updated last week
- ☆82Updated 7 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- Coq Enhancement Proposals☆43Updated last week
- Quantitative Type Theory implementation☆54Updated 3 years ago