jsiek / abstract-binding-treesLinks
Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
☆79Updated 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
Sorting:
- Formalizations of Gradually Typed Languages in Agda☆59Updated last week
- Unification and type inference algorithms☆125Updated 10 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆53Updated 5 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A TACtic library for Agda☆50Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆85Updated 4 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- ☆36Updated 4 years ago
- ☆51Updated 4 months ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆84Updated 9 years ago
- Where my everyday research happens☆55Updated last week
- A tutorial on how Agda infers things☆63Updated 5 months ago
- Lecture notes on realizability☆75Updated 10 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 3 months ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 8 months ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 5 months ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- A work-in-progress core language for Agda, in Agda☆61Updated last week
- A prototypical dependently typed languages with sized types and variances☆115Updated 5 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated last month
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 4 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- Tiny type-checker with dependent types☆78Updated 11 years ago