polytypic / f-omega-mu
Fωμ type checker and compiler
☆51Updated last year
Related projects ⓘ
Alternatives and complementary repositories for f-omega-mu
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- A pure type system implemented in OCaml☆77Updated 3 years ago
- 🪆 A Staged Type Theory☆34Updated last year
- A dependent type theory with user defined data types☆45Updated 3 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆29Updated last year
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated last year
- A verified compiler for a lazy functional language☆32Updated last month
- 🦠 Reusable components based on algebraic effects☆47Updated last month
- A type theory with native support for Polynomial Functors.☆38Updated last year
- A simple implementation of linear type theory☆38Updated 7 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Anders: Cubical Type Checker☆18Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 5 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- ☆47Updated last month
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆53Updated 6 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A tutorial on how Agda infers things☆36Updated 3 years ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- A simple functional programming language.☆21Updated 3 years ago
- ♾️ A library for universe levels and universe polymorphism☆33Updated last week
- IO using sized types and copatterns☆33Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical types☆25Updated this week