jsiek / abstract-binding-treesLinks
Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
☆78Updated last month
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:
- Formalizations of Gradually Typed Languages in Agda☆57Updated 7 months ago
- A TACtic library for Agda☆49Updated last year
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- A tutorial on how Agda infers things☆61Updated 2 months ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 3 weeks ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- ☆36Updated 3 years ago
- An enhanced unification algorithm for Coq☆56Updated 5 months ago
- ☆84Updated 8 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- HoTT in Lean 3☆82Updated 5 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆62Updated last year
- being a particular fragment of Haskell, extended to a proof system☆38Updated last month
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 2 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 4 months ago