gfngfn / toy-macro-ml
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:
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated last month
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 7 years ago
- Delimited continuations in byte-code and native OCaml☆27Updated 4 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- Monad-based linear types in OCaml, with a few syntax extensions☆37Updated 5 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Type systems written in 1ML☆9Updated 5 years ago
- The Alms Programming Language☆44Updated 6 years ago
- secret project☆17Updated 7 years ago
- MixML prototype interpreter☆27Updated 5 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 7 months ago
- Experimental functional language☆17Updated 2 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆65Updated this week
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated last year
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- An interpreter of F-ing modules☆19Updated 5 years ago
- A Datalog implementation with an OCaml inspired module system☆44Updated 6 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- Choice operator in OCaml, providing a backtracking monad☆25Updated 3 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 10 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- A collection of SML utility modules that are useful for compiler writing.☆11Updated 2 weeks ago
- multi-shot continuations in OCaml☆48Updated 3 months ago