|
Download | Documentation | Papers | Bugs | People | About |
The development of the ML Kit began in 1989 at Edinburgh
University. Originally, the project had two purposes:
Version 3 compiles all of Standard ML, in particular Modules are compiled using a technique called static interpretation. Moreover, considerable effort was devoted to tuning the system. The general approach we take in the Kit is to try to get the functionality right first and then gradually replace inefficient data structures and algorithms with better ones. A nice side-effect of this strategy is that the Kit contains more and more reusable modules that implement classical data structures and algorithms from the literature. Examples include sorting, union-find, Patricia trees and directed graphs (strongly connected components, etc.)
Version 4.0.0 has support for garbage collection in combination with region inference and the HP backend of version 3.0 has been replaced with a native backend for Intel's x86 architecture and a bytecode backend. Many more features have been added to the ML Kit since version 3.0; see the documentation for details.
People whom we wish to thank for contributing with bug reports include, but are not limited to (in alphabetical order) Johnny Andersen, Ken Friis Larsen, Daniel Wang, and Stephen Weeks.
mlkit@it.edu