jsiek / abstract-binding-treesLinks
Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
☆79Updated 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
Sorting:
- Formalizations of Gradually Typed Languages in Agda☆59Updated this week
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆61Updated 6 years ago
- A TACtic library for Agda☆50Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 2 months ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A tutorial on how Agda infers things☆63Updated 4 months ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 5 months ago
- A work-in-progress core language for Agda, in Agda☆59Updated this week
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- An interactive theorem prover based on lambda-tree syntax☆97Updated last week
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- ☆51Updated 3 months ago
- ☆36Updated 4 years ago
- Where my everyday research happens☆55Updated 2 weeks ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 4 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated last week
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated last month
- # A simple variable binding library based on well-scoped indices and environments☆27Updated last month
- Normalization by Evaluation for Martin-Löf Type Theory☆130Updated last year
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago