Ekdohibs / joujou
A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a static type system with inference of types and effects, with subtyping.
☆87Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for joujou
- Example row-polymorphism implementations☆59Updated last year
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- The language of the future!☆72Updated 10 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆43Updated 2 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆29Updated last year
- A toy language based on LLVM that implements the System Fω type-system☆103Updated last year
- MetaML and MetaOCaml bibliography☆85Updated 2 months ago
- Compiler for a subset of the ML (really OCaml) language. LLVM is used as a backend.☆30Updated 3 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆99Updated last year
- A statically-typed programming language based on "F-ing modules"☆80Updated 4 years ago
- A pure type system implemented in OCaml☆77Updated 3 years ago
- OCaml backend for Agda☆39Updated 6 years ago
- System Fω interpreter for use in Advanced Functional Programming course☆65Updated last year
- Standard ML compiler based on typed intermediate languages.☆46Updated 10 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 5 years ago
- Hindley-Milner type inference using constraints☆50Updated 7 years ago
- A dependent type theory with user defined data types☆45Updated 3 years ago
- A "implementation" of Girard's paradox in OCaml☆105Updated 9 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 7 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Unification and type inference algorithms☆123Updated 9 years ago
- OCaml with macros☆54Updated last week
- Ropes ("heavyweight strings") for OCaml☆49Updated 3 months ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago