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☆59Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- 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
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last week
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- ☆48Updated 2 months ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated this week
- Unification and type inference algorithms☆125Updated 10 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A verified compiler for a lazy functional language☆37Updated this week
- Setoid type theory implementation☆38Updated last year
- being an operating system for typechecking processes☆128Updated 2 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- ☆36Updated 3 years ago
- high-performance cubical evaluation☆74Updated 3 months ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 2 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A work-in-progress core language for Agda, in Agda☆55Updated last month