jonsterling / dreamttLinks
A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
☆85Updated 4 years ago
Alternatives and similar repositories for dreamtt
Users that are interested in dreamtt are comparing it to the libraries listed below
Sorting:
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- 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
- A prototypical dependently typed languages with sized types and variances☆115Updated 5 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- Normalization by Evaluation for Martin-Löf Type Theory☆131Updated last year
- A dependent type theory with user defined data types☆47Updated 4 years ago
- ☆51Updated 4 months ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 4 months ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- Setoid type theory implementation☆38Updated 2 years ago
- ☆36Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- A tutorial on how Agda infers things☆63Updated 6 months ago
- ♾️ A library for universe levels and universe polymorphism☆36Updated last month
- Formalizations of Gradually Typed Languages in Agda☆59Updated 3 weeks ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- HoTT in Lean 3☆82Updated 5 years ago
- being an operating system for typechecking processes☆130Updated 3 months ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Unification and type inference algorithms☆127Updated 10 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago