gfngfn / toy-macro-mlLinks
An implementation of MacroML [Ganz, Sabry & Taha 2001]
☆32Updated 6 years ago
Alternatives and similar repositories for toy-macro-ml
Users that are interested in toy-macro-ml are comparing it to the libraries listed below
Sorting:
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 6 months ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆68Updated 5 months ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- MetaML and MetaOCaml bibliography☆94Updated 10 months ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- Delimited continuations in byte-code and native OCaml☆27Updated 4 years ago
- Efficient binder representation in OCaml☆43Updated last year
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Monad-based linear types in OCaml, with a few syntax extensions☆37Updated 6 years ago
- secret project☆17Updated 7 years ago
- multi-shot continuations in OCaml☆49Updated last week
- The Alms Programming Language☆44Updated 7 years ago
- A collection of SML utility modules that are useful for compiler writing.☆11Updated 5 months ago
- An MVC library for writing interactive webpages in OCaml☆35Updated 10 years ago
- Choice operator in OCaml, providing a backtracking monad☆26Updated 3 years ago
- OCaml backend for Agda☆40Updated 7 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 5 months ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 2 months ago
- 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
- flexible 'let rec' generation for MetaOCaml☆26Updated 2 months ago
- An interpreter of F-ing modules☆19Updated 6 years ago
- Higher kinded polymorphism in SML☆15Updated 5 years ago
- Ropes ("heavyweight strings") for OCaml☆48Updated last year
- A simple implementation of linear type theory☆38Updated 8 years ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 11 years ago