Copyright © Philip M. Parker, INSEAD. Terms of Use.

MOSCOW ML

Specialty Definition: MOSCOW ML

Domain	Definition
Computing	Moscow ML A light-weight implementation of Standard ML written by Sergei Romanenko of the Keldysh Institute of Applied Mathematics with assistance from Peter Sestoft , Royal Veterinary and Agricultural University. Moscow ML is based on CAML Light. Version: 1.20 implements the Standard ML Core language. The sublanguage of Modules implemented by Moscow ML contains signatures and non-nested structures, and identifies structures with source files. It is certainly less expressive than the full Standard ML Modules language, but the type-safe separate compilation facility is simple, useful, and easy to use. It is the intention to implement the full Standard ML Modules language (including functors) in due course. Compilation of a signature produces a compiled interface file, which is used when compiling other signatures and structures. Compilation of a structure produces a bytecode file. Bytecode files are compact and load fast. For instance, a 3250-line program consisting of 24 structures and 17 signatures compiles to 221 KB of bytecode and 241 KB of compiled signatures. Starting the ML system and loading the 24 bytecode files takes 1-2 cpu seconds plus network delays, less that 5 seconds real time in all. Release 1.20 permits loading of precompiled bytecode files into the top-level interactive session. The next release will be able to create stand-alone executables by linking bytecode files. There is a mechanism for adding basis libraries, as in Caml Light. Release 1.20 includes the basis libraries Array, List, and Vector and the MS-DOS version includes the Graphics library from Caml Light. In principle, Moscow ML can be compiled on any platform supported by Caml Light. So far we have tried Intel 80386-based IBM PCs running MS-DOS, Microsoft Windows, OS/2 or Linux, DEC MIPS running Ultrix, DEC Alpha running OSF/1, Sun-4 running SunOS, HP9000 running HP/UX, SGI MIPS running IRIX 5. Moscow ML is particularly useful when fast compilation and modest storage consumption are more important than fast program execution. Thanks to the efficient Caml Light run-time system used in Moscow ML, it compiles fast and uses little memory, typically 5-10 times less memory than SML/NJ 0.93 and 2-3 times less than Edinburgh ML. Yet the bytecode is only 3 to 10 times slower than SML/NJ 0.93 compiled native code (fast on IBM PCs, slower on RISCs). DOS (ftp://dina.kvl.dk/pub/Peter.Sestoft/mosml/mos12bin.zip). Linux (ftp://dina.kvl.dk:pub/Peter.Sestoft/mosml/linux-mos12bin.tar.gz). Source (ftp://dina.kvl.dk:pub/Peter.Sestoft/mosml/mos12src.tar.gz). Caml Light 0.61 and gcc are required to recompile Moscow ML for Unix or Caml Light 0.61, djgpp, Perl, and Borland C++ version 2.0 (or later) to recompile Moscow ML for DOS. (1994-12-12). Source: The Free On-line Dictionary of Computing.
Source: compiled by the editor from various references; see credits.

Anagrams: MOSCOW ML

Scrabble® Enable2K-Verified Anagrams
	Words within the letters "c-l-m-m-o-o-s-w"
	-3 letters: cools, cowls, locos, looms, mools, osmol, scowl, wools.
	-4 letters: cols, cool, coos, cowl, cows, cwms, loco, loom, loos, lows, mocs, mols, moms, mool, moos, mows, owls, scow, slow, solo, wool, woos.
	-5 letters: col, coo, cos, cow, cwm, loo, low, moc, mol, mom, moo, mos, mow, oms, owl, sol, som, sow, woo, wos.
	Words containing the letters "c-l-m-m-o-o-s-w"
	+3 letters: commonweals.
	+5 letters: commonwealths.
Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro.

Alternative Orthography: MOSCOW ML

Hexadecimal (or equivalents, 770AD-1900s) (references)

4D 4F 53 43 4F 57 4D 4C

Leonardo da Vinci (1452-1519; backwards) (references)

Binary Code (1918-1938, probably earlier) (references)

01001101 01001111 01010011 01000011 01001111 01010111 00100000 01001101 01001100

HTML Code (1990) (references)

&#77 &#79 &#83 &#67 &#79 &#87 &#32 &#77 &#76

ISO 10646 (1991-1993) (references)

004D 004F 0053 0043 004F 0057 004D 004C

Encryption (beginner's substitution cypher): (references)

47495337495724746

INDEX

1. Anagrams
2. Orthography
3. Bibliography

Copyright © Philip M. Parker, INSEAD. Terms of Use.