AndrasKovacs / dtt-rtcg
Demo for dependent types + runtime code generation
☆12Updated this week
Related projects ⓘ
Alternatives and complementary repositories for dtt-rtcg
- Formalization of CBPV extended with effect and coeffect tracking☆11Updated 2 months ago
- An implementation of a simple Neural network in Idris using category theory.☆22Updated last month
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆32Updated last year
- A simple implementation of XTT, "A cubical language for Bishop sets"☆26Updated 2 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- Dependently typed programming language written in Haskell☆22Updated 2 years ago
- ☆16Updated 7 months ago
- A Teeny Type Theory☆26Updated 2 years ago
- 🪆 A Staged Type Theory☆34Updated last year
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- A verified, modern, hardened memory allocator.☆14Updated 2 weeks ago
- A simple functional programming language.☆21Updated 3 years ago
- Work in progress on semi-simplicial types☆23Updated last year
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- A simple λProlog interpreter☆20Updated 2 years ago
- Linear map categories in Agda☆5Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 9 months ago
- Haskell bindings to Chez Scheme☆10Updated last year
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆19Updated last month
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- A formalization of the theory behind the mugen library☆15Updated 4 months ago
- A usable type system for call by push-value☆28Updated 4 years ago
- Graded Dependent Type systems☆23Updated last year
- Formalization of type theory☆22Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 3 years ago
- A type theory for tiny objects☆10Updated 11 months ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated last year