jonsterling / dreamttLinks
A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
☆82Updated 3 years ago
Alternatives and similar repositories for dreamtt
Users that are interested in dreamtt are comparing it to the libraries listed below
Sorting:
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆127Updated last year
- ☆36Updated 3 years ago
- Implementation for ICFP 2020 paper☆53Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- ☆47Updated 3 weeks ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 6 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A tutorial on how Agda infers things☆42Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 10 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 7 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 9 months ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago