jonsterling / dreamttLinks
A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
☆83Updated 3 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☆60Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 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 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- ☆48Updated 3 weeks ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- A dependent type theory with user defined data types☆47Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 2 weeks ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last month
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- This aims to be the most pretentious implementation of stlc in existence☆64Updated 3 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 months ago
- ☆36Updated 3 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A tutorial on how Agda infers things☆61Updated 2 months ago
- Benchmarking various normalization algorithms for the lambda calculus☆47Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated 2 months ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last month