polytypic / f-omega-muLinks
Fωμ type checker and compiler
☆54Updated 2 years ago
Alternatives and similar repositories for f-omega-mu
Users that are interested in f-omega-mu are comparing it to the libraries listed below
Sorting:
- A pure type system implemented in OCaml☆78Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- 🦠 Reusable components based on algebraic effects☆51Updated last month
- 🩺 A library for compiler diagnostics☆47Updated last month
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Demo for dependent types + runtime code generation☆71Updated 7 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A verified compiler for a lazy functional language☆37Updated last week
- MetaML and MetaOCaml bibliography☆93Updated 10 months ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated 7 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Prototype for https://github.com/Innf107/vega☆19Updated last year
- ☆44Updated 3 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A tutorial on how Agda infers things☆61Updated 2 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- OCaml backend for Idris2☆19Updated 4 years ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- A pretty-printing combinator library for OCaml☆51Updated last year
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 4 months ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- A simple functional programming language.☆22Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- A toy dependent typed language.☆32Updated this week
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago