| Expressions |
Domain |
Definition |
| ANU ML |
Computing |
An implementation of SML by the Australian National University for Motorola 68020, Vax and Pyramid. (1995-11-26). Source: The Free On-line Dictionary of Computing.. |
| Concurrent ML |
Computing |
Concurrent ML (CML) A concurrent extension of SML/NJ written by J. Reppy at Cornell University in 1990. CML supports dynamic thread creation and synchronous message passing on typed channels. Threads are implemented using first-class continuations. First-class synchronous operations allow users to tailor their synchronization abstractions for their application. CML also supports both stream I/O and low-level I/O in an integrated fashion. Latest version: 0.9.8, as of 1994-12-21, requires SML/NJ 0.75 or later. (ftp://ftp.cs.cornell.edu/pub/). E-mail: (bugs). ["CML: A Higher-Order Concurrent Language", John H. Reppy, SIGPLAN Notices 26(6):293-305, June 1991]. (2000-08-09). Source: The Free On-line Dictionary of Computing.. |
| Extended ML |
Computing |
A language by Don Sannella of the University of Edinburgh combining algebraic specification and functional programming. ["Program Specification and Development in Standard ML", D. Sannella et al, 12th POPL, ACM 1985]. (1994-12-12). Source: The Free On-line Dictionary of Computing.. |
| Forced expiratory flow between 200 and 1200 ml of the forced vital capacity,forced expiratory flow 200-1200,FEF200-1200,maximal expiratory flow rate 200-1200,MEFR200-1200 |
Medicine |
The average flow rate for the liter of gas expired after the first 200 ml during a forced expiratory maneuver. Source: European Union. (references) |
| Lazy Standard ML |
Computing |
Lazy Standard ML (LSML) A lazy variant of SML, allowing cyclic val definitions, by Prateek Mishra . Latest version: 0.43-1, as of 1993-11-15. Not to be confused with LML. (ftp://sbcs.sunysb.edu/pub/lsml). (1999-08-30). Source: The Free On-line Dictionary of Computing.. |
| Micro ML |
Computing |
Micro ML (uML) An interpreter for a subset of SML. Runs on MS-DOS. Written at the University of Umea, Sweden. (ftp://ftp.cs.umu.se/pub/umlexe01.zoo). Source: The Free On-line Dictionary of Computing.. |
| ML (land status records) |
Environment |
Mineral location. (references) |
| ML Kit |
Computing |
ML Kit The ML Kit is a straight translation of the Definition of Standard ML into a collection of Standard ML modules. For example, every inference rule in the Definition is translated into a small piece of Standard ML code which implements it. The translation has been done with as little originality as possible - even variable conventions from the Definition are carried straight over to the Kit. The Kit is intended as a tool box for those people in the programming language community who may want a self-contained parser or type checker for full Standard ML but do not want to understand the clever bits of a high-performance compiler. We have tried to write simple code and modular interfaces. Version 1 interpreter, documentation Nick Rothwell, David N. Turner, Mads Tofte , and Lars Birkedal at Edinburgh and Copenhagen Universities. (ftp://ftp.diku.dk/diku/users/birkedal/). UK: ftp export/ml/mlkit/ from lfcs.ed.ac.uk (1993-03-12). Source: The Free On-line Dictionary of Computing.. |
| ML PED |
Aerospace |
Mobile Launcher Pedestal. (references) |
| ML Threads |
Computing |
ML Threads SML/NJ with mutual exclusion primitives similar to those in Modula-2+ and Mesa. Written by Greg Morrisett . Lightweight threads are created using fork. They are pre-emptively scheduled and communicate via shared memory which can be protected by a "mutex" (monitor). Implementations for Motorola 68020, SPARC and MIPS and VAX- and MIPS-based multiprocessors. ["Adding Threads to Standard ML", E. Cooper et al, CMU-CS-90-186, CMU Dec 1990]. Source: The Free On-line Dictionary of Computing.. |
| Moscow ML |
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.. |
| POPLOG ML |
Computing |
SML for the Poplog system from the University of Sussex, UK. Source: The Free On-line Dictionary of Computing.. |
| Standard ML |
Computing |
Standard ML (SML) Originally an attempt by Robin Milner ca. 1984 to unify the dialects of ML, SML has evolved into a robust general-purpose language. Later versions have been maintained by D. B. MacQueen, Lal George , and J. H. Reppy at AT&T, and A. W. Appel. SML is functional, with imperative features. It is environment based and strict. It adds to ML the call-by-pattern of Hope, recursive data types, reference types, typed exceptions, and modules. (The "core" language excludes the modules). Standard ML is polymorphically typed and its module system supports flexible yet secure large-scale programming. Standard ML of New Jersey is an optimizing native-code compiler for Standard ML that is written in Standard ML. It runs on a wide range of architectures. The distribution also contains: an extensive library - The Standard ML of New Jersey Library, including detailed documentation; Concurrent ML (CML); eXene - an elegant interface to X11 (based on CML); SourceGroup - a separate compilation and "make" facility. Implementations: SML/NJ, POPLOG ML, Poly/ML, Edinburgh SML, ANU ML, Micro ML, lazy sml2c.sml2c compiles to C. See also ML Kit. Version 0.93 runs on 68000, SPARC, MIPS, HPPA, RS/6000, Intel 386, Intel 486 and Macintosh. Manual (http://www.dcs.napier.ac.uk/course-notes/sml/manual.html). FTP from ATT (ftp://research.att.com/dist/ml/). FTP from Suny SB (ftp://sbcs.sunysb.edu/). Mailing list: sml-request@cs.cmu.edu. ["A Proposal for Standard ML", R. Milner, ACM Symp on LISP and Functional Prog 1984, pp. 184-197]. (1995-12-24). Source: The Free On-line Dictionary of Computing.. |
| Standard ML of New Jersey |
Computing |
(SML/NJ) An implementation of SML by Andrew Appel at Princeton and Dave MacQueen at AT&T. Version 0.93. ["Standard ML of New Jersey", A. Appel et al, "Proc Third Intl Symp on Prog Lang Impl and Logic Programming", LNCS Springer 1991]. Versions for Unix, Mac. (ftp://cs.yale.edu/pub/ml), (ftp://research.att.com/dist/ml). Mailing list: sml@cs.cmu.edu. Source: The Free On-line Dictionary of Computing.. |
|
Source: compiled by the editor from various references; see credits.
| Top |