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
  ☆65Updated 2 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 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
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆56Updated 3 years ago
• SomewhatML / sml-analyzer
  An experimental language server for SomewhatML
  ☆24Updated 3 years ago
• andreypopp / type-systems
  Playing with type systems
  ☆51Updated last year
• Ekdohibs / joujou
  A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …
  ☆91Updated 7 years ago
• FrankBro / ordo
  Ordo: A minimalist language with row polymorphism
  ☆85Updated this week
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 3 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• kit-ty-kate / labrys
  A toy language based on LLVM that implements the System Fω type-system
  ☆114Updated 2 years ago
• RedPRL / asai
  🩺 A library for compiler diagnostics
  ☆52Updated 2 months ago
• fpottier / pprint
  A pretty-printing combinator library for OCaml
  ☆50Updated last year
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆30Updated this week
• 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
• OCamlPro / ocaml-canvas
  The OCaml-Canvas library provides a portable Canvas for OCaml
  ☆60Updated last year
• RedPRL / algaeff
  🦠 Reusable components based on algebraic effects
  ☆51Updated 2 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
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆48Updated 6 years ago
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆81Updated 5 years ago
• modular-macros / ocaml-macros
  OCaml with macros
  ☆60Updated 3 months ago
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆104Updated 8 months ago
• bynect / algorithm-w
  Type inference implementation in OCaml using Algorithm W
  ☆10Updated 4 years ago
• gfngfn / toy-macro-ml
  An implementation of MacroML [Ganz, Sabry & Taha 2001]
  ☆33Updated 7 years ago
• janestreet / higher_kinded
  A library with an encoding of higher kinded types in OCaml
  ☆43Updated 3 weeks ago
• rlepigre / ocaml-bindlib
  Efficient binder representation in OCaml
  ☆43Updated last year
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆20Updated last month
• murmour / mparser
  A simple monadic parser combinator library for OCaml
  ☆69Updated 3 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆38Updated 7 years ago