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.
☆90Updated 6 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
- The language of the future!☆72Updated last year
- MetaML and MetaOCaml bibliography☆94Updated 8 months ago
- System Fω interpreter for use in Advanced Functional Programming course☆65Updated last year
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 2 months ago
- A toy language based on LLVM that implements the System Fω type-system☆111Updated last year
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- Example row-polymorphism implementations☆61Updated last year
- A prototype programming language for programming with runners☆91Updated 3 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- OCaml interpreter☆102Updated 5 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 3 months ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- Efficient binder representation in OCaml☆43Updated last year
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A compiler for the gradually typed lambda calculus☆75Updated 3 years ago
- Playing with type systems☆51Updated 7 months ago
- A pretty-printing combinator library for OCaml☆51Updated 11 months ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆28Updated last year
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- The LLVM tutorial using OCaml☆61Updated 5 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Nanopass for OCaml☆146Updated 7 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆141Updated 6 years ago
- Prototype type inference engine☆203Updated 6 months ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago