Ekdohibs / joujouLinks
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.
☆91Updated 7 years ago
Alternatives and similar repositories for joujou
Users that are interested in joujou are comparing it to the libraries listed below
Sorting:
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- OCaml interpreter☆102Updated 6 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104Updated 8 months ago
- The language of the future!☆72Updated 2 years ago
- System Fω interpreter for use in Advanced Functional Programming course☆68Updated 2 years ago
- MetaML and MetaOCaml bibliography☆99Updated last year
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 9 months ago
- A toy language based on LLVM that implements the System Fω type-system☆114Updated 2 years ago
- Standard ML compiler based on typed intermediate languages.☆51Updated 11 years ago
- A prototype programming language for programming with runners☆92Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- A pure type system implemented in OCaml☆78Updated 5 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- FunTAL: mixing a functional language with assembly.☆41Updated 8 years ago
- Playing with type systems☆51Updated last year
- Fωμ type checker and compiler☆56Updated 3 years ago
- LL(1) parser generator verified in Coq☆48Updated 6 years ago
- Efficient binder representation in OCaml☆43Updated last year
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆33Updated 7 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- Hindley-Milner type inference using constraints☆50Updated 9 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆146Updated 6 years ago
- Prototype type inference engine☆204Updated last year
- A nano "theorem prover".☆62Updated 6 years ago
- A pretty-printing combinator library for OCaml☆50Updated last year
- A SuperCompiler for Martin-Löf's Type Theory☆123Updated 4 years ago
- TiML: A Functional Programming Language with Time Complexity☆80Updated 8 years ago