jonsterling / dreamtt
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
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Implementation for ICFP 2020 paper☆50Updated 3 years ago
- ☆36Updated 3 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- This aims to be the most pretentious implementation of stlc in existence☆62Updated 3 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 5 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 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
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆56Updated 4 years ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 4 months ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- ☆47Updated 4 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆124Updated 10 months ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A verified compiler for a lazy functional language☆34Updated 2 weeks ago
- high-performance cubical evaluation☆71Updated 4 months ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- Setoid type theory implementation☆38Updated last year
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆35Updated last year
- being the materials for a paper I have in mind to write about the bidirectional discipline☆50Updated 8 months ago
- Algebraic proof discovery in Agda☆32Updated 3 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated last month