jonsterling / dreamtt
A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
☆82Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for dreamtt
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- This aims to be the most pretentious implementation of stlc in existence☆60Updated 2 years ago
- A dependent type theory with user defined data types☆45Updated 3 years ago
- Agda formalisation of second-order abstract syntax☆52Updated 2 years ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 5 months ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- ☆47Updated last month
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- Implementation for ICFP 2020 paper☆49Updated 3 years ago
- ☆35Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆53Updated 6 months ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- high-performance cubical evaluation☆68Updated 4 months ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- A tutorial on how Agda infers things☆36Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- 🪆 A Staged Type Theory☆34Updated last year
- A pure type system implemented in OCaml☆77Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- being an operating system for typechecking processes☆121Updated last year
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 8 months ago
- Setoid type theory implementation☆38Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆71Updated last week
- Spartan implementation of H.O.T.T.☆25Updated 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
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- ♾️ A library for universe levels and universe polymorphism☆33Updated last week
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago