gfngfn / toy-macro-mlLinks
An implementation of MacroML [Ganz, Sabry & Taha 2001]
☆33Updated 7 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:
- FunTAL: mixing a functional language with assembly.☆41Updated 8 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 3 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 9 months ago
- MetaML and MetaOCaml bibliography☆98Updated last year
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- Yet another tiny tiny self-hosted OCaml compiler with an also tiny standard library.☆57Updated 6 years ago
- Delimited continuations in byte-code and native OCaml☆27Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Standard ML compiler based on typed intermediate languages.☆51Updated 11 years ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆69Updated 8 months ago
- multi-shot continuations in OCaml☆51Updated last month
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆90Updated 7 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- 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
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- The Alms Programming Language☆44Updated 7 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- flexible 'let rec' generation for MetaOCaml☆28Updated 4 months ago
- An implementation of Daan Leijen's λ^k effect-conscience type system in OCaml☆15Updated 5 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 7 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Brainfuck formalized in Coq☆31Updated 3 years ago
- Choice operator in OCaml, providing a backtracking monad☆26Updated 3 years ago
- The language of the future!☆73Updated 2 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated last month
- 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
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104Updated 7 months ago