Alternatives and similar repositories for match-compile

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

• 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
• 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 2 years ago
• nikomatsakis / bidir-type-infer
  Implementing the type system described in the paper "Complete and Easy Bidirectional Type Inference" in Rust
  ☆46Updated 9 years ago
• mb64 / prolog
  A simple prolog implementation in Rust
  ☆26Updated 4 years ago
• naalit / pika
  A WIP little dependently-typed systems language
  ☆41Updated last year
• bryal / kvasir
  A general-purpose language inspired by Scheme and Rust and Haskell and ML and cetera
  ☆21Updated 3 years ago
• exists-forall / nickel
  A safe and efficient target language for functional compilers
  ☆20Updated 7 years ago
• paulstansifer / unseemly
  Macros have types!
  ☆131Updated 2 years ago
• andreypopp / type-systems
  Playing with type systems
  ☆51Updated 7 months ago
• contificate / match
  Match compilation algorithm in OCaml
  ☆29Updated 6 months ago
• hkust-taco / mlstruct
  Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"
  ☆41Updated 8 months ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• jfecher / algorithm-j
  A minimal implementation of Hindley-Milner's Algorithm J in OCaml
  ☆72Updated 3 years ago
• maybevoid / lambek
  Type-Level Programming in Rust
  ☆28Updated 3 years ago
• namin / higher-rank
  Practical type inference for arbitrary-rank types
  ☆11Updated 6 years ago
• iwillspeak / ullage
  A statically-typed compiled language defined by a simple grammar
  ☆24Updated 3 years ago
• lameiro / simple-tracing-jit
  A simple interpreter featuring a tracing JIT
  ☆16Updated 14 years ago
• AshleyYakeley / Truth
  Changes and Pinafore projects. Pull requests not accepted.
  ☆33Updated last week
• bmourad01 / ocamlchess
  UCI-compatible chess engine in OCaml.
  ☆13Updated 4 months ago
• FrankBro / ordo
  Ordo: A minimalist language with row polymorphism
  ☆84Updated 4 months ago
• nwoeanhinnogaehr / algorithmw-rust
  A basic implementation of Hindley-Milner type inference via Algorithm W in Rust.
  ☆44Updated 9 years ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆27Updated 6 years ago
• matklad / miniml
  ☆22Updated 9 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 3 years ago
• hydrolarus / cytosol
  A programming language somewhat resembling cellular processes.
  ☆34Updated 3 years ago
• osa1 / mincaml
  A MinCaml compiler implemented in Rust
  ☆43Updated 2 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆32Updated 2 weeks ago
• cuplv / iodyn-lang.rust
  IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections
  ☆15Updated 7 years ago
• acorrenson / owl
  A mini language for logic programming
  ☆23Updated 5 years ago