polytypic / f-omega-mu
Fωμ type checker and compiler
☆51Updated last year
Related projects ⓘ
Alternatives and complementary repositories for f-omega-mu
- 🪆 A Staged Type Theory☆34Updated last year
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆29Updated last year
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- 🦠 Reusable components based on algebraic effects☆48Updated last month
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- A pure type system implemented in OCaml☆77Updated 3 years ago
- A dependent type theory with user defined data types☆45Updated 3 years ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated last year
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- Session types in Idris2!☆27Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A type theory with native support for Polynomial Functors.☆38Updated last year
- ☆46Updated last month
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- 🩺 A library for compiler diagnostics☆35Updated last week
- ☆38Updated 2 years ago
- multi-shot continuations in OCaml☆45Updated 2 weeks ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- A verified compiler for a lazy functional language☆31Updated 3 weeks ago
- A simple functional programming language.☆21Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Dromedary is an experimental subset of OCaml, using constraint-based type inference!☆47Updated 2 weeks ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago