Alternatives and similar repositories for match

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

• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆66Updated last month
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆56Updated 2 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 5 years ago
• Ekdohibs / joujou
  A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …
  ☆90Updated 7 years ago
• FrankBro / ordo
  Ordo: A minimalist language with row polymorphism
  ☆85Updated 9 months ago
• fpottier / pprint
  A pretty-printing combinator library for OCaml
  ☆51Updated last year
• Timothy-G-Griffin / cc_cl_cam_ac_uk
  OCaml code for Compiler Construction course at University of Cambridge
  ☆43Updated 4 years ago
• andreypopp / type-systems
  Playing with type systems
  ☆51Updated last year
• gfngfn / toy-macro-ml
  An implementation of MacroML [Ganz, Sabry & Taha 2001]
  ☆33Updated 7 years ago
• kit-ty-kate / labrys
  A toy language based on LLVM that implements the System Fω type-system
  ☆114Updated 2 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• soren-n / bidi-higher-rank-poly
  Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…
  ☆22Updated 4 years ago
• SomewhatML / sml-analyzer
  An experimental language server for SomewhatML
  ☆24Updated 3 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated last year
• modular-macros / ocaml-macros
  OCaml with macros
  ☆60Updated 3 months ago
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆81Updated 5 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• pdarragh / parsing-with-zippers-paper-artifact
  The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.
  ☆29Updated last year
• 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
• janestreet / higher_kinded
  A library with an encoding of higher kinded types in OCaml
  ☆42Updated 3 months ago
• metaocaml / metaocaml-bibliography
  MetaML and MetaOCaml bibliography
  ☆98Updated last year
• RedPRL / algaeff
  🦠 Reusable components based on algebraic effects
  ☆51Updated last month
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆104Updated 7 months ago
• LPTK / simpler-sub
  Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…
  ☆27Updated 3 years ago
• bynect / algorithm-w
  Type inference implementation in OCaml using Algorithm W
  ☆10Updated 4 years ago
• art-w / deque
  Purely Functional, Real-Time Deques with Catenation (Kaplan & Tarjan)
  ☆123Updated last year
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated 2 years ago
• yallop / ocaml-flap
  A deterministic parser with fused lexing
  ☆75Updated 2 years ago
• jkoppel / ecta
  ☆37Updated last year