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☆58Updated 8 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- A TACtic library for Agda☆50Updated last year
- A tutorial on how Agda infers things☆62Updated 3 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Where my everyday research happens☆55Updated last week
- An interactive theorem prover based on lambda-tree syntax☆98Updated 2 weeks ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- ☆36Updated 3 years ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 6 months ago
- Benchmarks for capture-avoiding substitution☆120Updated 4 months ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- HoTT in Lean 3☆82Updated 5 years ago
- A work-in-progress core language for Agda, in Agda☆55Updated 2 weeks ago
- An enhanced unification algorithm for Coq☆56Updated 6 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- high-performance cubical evaluation☆75Updated 5 months ago
- Lecture notes on realizability☆74Updated 8 months ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated last week
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 2 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- ☆84Updated 8 years ago