This is a work-in-progress ML compiler, written in Standard ML. It consists of most of a front-end: a lexer, a parser, a type checker (along with Hindley-Milner type inference), and a naive pattern compiler. It's capable of parsing and type checking programs that are recognizably ML, e.g.
datatype 'a tree = Leaf of 'a
| Branch of 'a tree * 'a tree
val reflect =
fn t =>
case t of
Leaf x => t
| Branch (t1, t2) => Branch (reflect t2, reflect t1)
The parser accepts a concrete syntax that is mostly a subset of Standard ML, but diverges in a few places to cut corners: no top-level function declarations, just value bindings, constructors must be capitalized (if it's good enough for Haskell...), only pattern matching case expressions, no patterns in functions or lambdas, no syntactic sugar for lists, ... The type checker doesn't require rec after recursive value bindings (see reflect above)
Requires SML/NJ and QCheck/SML. To install QCheck, clone this repo and add QCHECK /path/to/qcheck/clone to your ~/.smlnj-pathconfig.
Use make test to compile and run the tests; see the Makefile for more targets.
It should build under MLton and other Standard ML compilers, as it doesn't use any language extensions, but this still needs to be tested and MLton .mlb files need to be written to make this easier.
Feel free to fork and work on anything in TODO.org
Not to be confused with MAML.