We have lots of ideas for projects to improve MLton, many of which we do not have time to implement, or at least haven't started on yet. Here is a list of some of those improvements, ranging from the easy (1 week) to the difficult (several months). If you have any interest in working on one of these, or some other improvement to MLton not listed here, please send mail to MLton@mlton.org.

• Port to new platform: Windows (native, not Cygwin or MinGW), ...

• Source-level debugger

• Heap profiler

• Interfaces to libraries: OpenGL, ...

• Additional constant types: Real80, ...

• An IDE (possibly integrated with Eclipse)

• Port MLRISC and use for code generation

• Optimizations

• Improved closure representation

Right now, MLton's closure conversion algorithm uses a simple flat closure to represent each function.

• Elimination of array bounds checks in loops

• Elimination of overflow checks on array index computations

• Common-subexpression elimination of repeated array subscripts

• Loop-invariant code motion, especially for tuple selects

• Auto-vectorization, for MMX/SSE/3DNow/AltiVec (see the work done on GCC)

• Analyses

• Uncaught exception analysis