Alternatives and similar repositories for joujou

Users that are interested in joujou are comparing it to the libraries listed below

• protz / mezzo
  The language of the future!
  ☆72Updated last year
• yallop / fomega
  System Fω interpreter for use in Advanced Functional Programming course
  ☆65Updated last year
• kit-ty-kate / labrys
  A toy language based on LLVM that implements the System Fω type-system
  ☆110Updated last year
• metaocaml / metaocaml-bibliography
  MetaML and MetaOCaml bibliography
  ☆94Updated 7 months ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 2 years ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆81Updated 4 years ago
• garrigue / certint
  A Certified Interpreter for ML with Structural Polymorphism
  ☆44Updated 3 months ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆90Updated 3 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆101Updated last month
• elpinal / modules-rs
  An interpreter of F-ing modules
  ☆19Updated 6 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• Gradual-Typing / Grift
  A compiler for the gradually typed lambda calculus
  ☆75Updated 3 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• rlepigre / ocaml-bindlib
  Efficient binder representation in OCaml
  ☆42Updated last year
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• johnwhitington / ocamli
  OCaml interpreter
  ☆102Updated 5 years ago
• dbp / funtal
  FunTAL: mixing a functional language with assembly.
  ☆40Updated 8 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 3 years ago
• JohnReppy / compiling-pattern-guards
  Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"
  ☆25Updated 2 years ago
• dannywillems / RML
  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
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆48Updated 10 years ago
• adamrk / llvm-ocaml-tutorial
  The LLVM tutorial using OCaml
  ☆61Updated 5 years ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 8 years ago
• fpottier / pprint
  A pretty-printing combinator library for OCaml
  ☆51Updated 11 months ago
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆131Updated 4 years ago