Alternatives and similar repositories for joujou:

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

• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆80Updated 4 years ago
• modular-macros / ocaml-macros
  OCaml with macros
  ☆57Updated 2 months ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 7 years ago
• protz / mezzo
  The language of the future!
  ☆72Updated last year
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 2 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• kseo / poly_constraints
  Hindley-Milner type inference using constraints
  ☆50Updated 8 years ago
• garrigue / certint
  A Certified Interpreter for ML with Structural Polymorphism
  ☆43Updated 2 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆45Updated 5 years ago
• JohnReppy / compiling-pattern-guards
  Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"
  ☆25Updated 2 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆105Updated 9 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆52Updated 2 years ago
• kit-ty-kate / labrys
  A toy language based on LLVM that implements the System Fω type-system
  ☆107Updated last year
• agda / agda-ocaml
  OCaml backend for Agda
  ☆39Updated 6 years ago
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆48Updated 10 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆101Updated last year
• cmaes / miniml
  Compiler for a subset of the ML (really OCaml) language. LLVM is used as a backend.
  ☆31Updated 4 years ago
• bobatkey / sott
  Simplified Observational Type Theory
  ☆81Updated last year
• rlepigre / ocaml-bindlib
  Efficient binder representation in OCaml
  ☆40Updated 8 months ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆107Updated 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.
  ☆37Updated 2 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago