Standard ML: Difference between revisions
Content added Content deleted
(Redirected to category linnk) |
|||
| Line 1: | Line 1: | ||
[[Category:Standard ML]] |
#REDIRECT [[:Category:Standard ML]] |
||
'''Standard ML''' (SML) is a general-purpose, modular, functional programming language with compile-time type checking and type inference. It is popular among compiler writers and programming language researchers, as well as in the development of theorem provers. |
|||
SML is a modern descendant of the ML programming language used in the LCF theorem-proving project. It is unique among widely used languages in that it has a formal specification, given as typing rules and operational semantics in The Definition of Standard ML (1990, revised and simplified as The Definition of Standard ML (Revised) in 1997). |
|||
==Implementations:== |
|||
* [http://en.wikipedia.org/wiki/SML/NJ Standard ML of New Jersey (wikipedia)]: a Princeton compiler and programming environment |
|||
* [http://mlton.org/ MLton (mlton.org)]: a whole program optimizing compiler |
|||
* [http://www.dina.kvl.dk/~sestoft/mosml.html Moscow ML (dina.kvl.dk)]: a derived codebase from [[Caml Light]] |
|||
==Citations== |
|||
* [http://en.wikipedia.org/wiki/Standard_ml Wikipedia:Standard ML] |
|||
{{Programming Language}} |
|||
Latest revision as of 13:28, 6 February 2007
Redirect to: