Alternatives and similar repositories for toy-macro-ml

Users that are interested in toy-macro-ml are comparing it to the libraries listed below

• dbp / funtal
  FunTAL: mixing a functional language with assembly.
  ☆41Updated 8 years ago
• garrigue / certint
  A Certified Interpreter for ML with Structural Polymorphism
  ☆45Updated 9 months 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
• 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
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆81Updated 5 years ago
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆51Updated 11 years ago
• ushitora-anqou / aqaml
  Yet another tiny tiny self-hosted OCaml compiler with an also tiny standard library.
  ☆57Updated 6 years ago
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 3 years ago
• keigoi / linocaml
  Monad-based linear types in OCaml, with a few syntax extensions
  ☆38Updated 6 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 7 years ago
• metaocaml / metaocaml-bibliography
  MetaML and MetaOCaml bibliography
  ☆98Updated last year
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆104Updated 7 months ago
• zinid / delimcc
  Delimited continuations in byte-code and native OCaml
  ☆27Updated 5 years ago
• ujamjar / hardcaml-zinc
  HardCaml implementation of the OCaml ZINC Abstract Machine
  ☆45Updated 6 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• yallop / staged-generic-programming
  Code for "Staged Generic Programming" (ICFP 2017)
  ☆28Updated 2 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 12 years ago
• kfl / wpp
  A Pretty Printer, based on Philip Wadler's "A prettier printer". But heavily modified to be efficient in a strict language.
  ☆19Updated 4 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆38Updated 7 years ago
• JohnReppy / compiling-pattern-guards
  Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"
  ☆25Updated 3 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
• reynir / Brainfuck
  Brainfuck formalized in Coq
  ☆31Updated 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
• whitequark / ocaml-llvm-ng
  A practical LLVM backend for OCaml (will never be finished)
  ☆35Updated 11 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• agda-attic / agda-ocaml
  OCaml backend for Agda
  ☆39Updated 7 years ago
• dhil / ocaml-multicont
  multi-shot continuations in OCaml
  ☆51Updated last month
• protz / mezzo
  The language of the future!
  ☆73Updated 2 years ago
• fpottier / pprint
  A pretty-printing combinator library for OCaml
  ☆51Updated last year