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 library for compiler diagnostics☆47Updated 2 months ago
- A pure type system implemented in OCaml☆77Updated 4 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
- A verified compiler for a lazy functional language☆37Updated this week
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- 🦠 Reusable components based on algebraic effects☆51Updated 2 months ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated this week
- MetaML and MetaOCaml bibliography☆94Updated 10 months ago
- A tutorial on how Agda infers things☆62Updated 3 months ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 5 months ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Demo for dependent types + runtime code generation☆72Updated 8 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A prototype programming language for programming with runners☆91Updated 4 years ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- Prototype for https://github.com/Innf107/vega☆19Updated last year
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- An enhanced unification algorithm for Coq☆56Updated 6 months ago
- A deterministic parser with fused lexing☆74Updated 2 years ago