Some of Sunday's edits have been lost. The edits from Saturday that were reverted have been restored. Site is now hosted on prgmr.com. Thank you for your patience. This notice will be removed one week from posting. --Michael Mol 18:12, 7 March 2010 (UTC)
Category:Standard ML
From Rosetta Code
| Execution method: | Compiled (machine code) |
|---|---|
| Type strength: | Strong |
| Type expression: | Implicit |
| Type checking: | Static |
| See Also: |
|
If you know Standard ML, please write code for some of the tasks not implemented in 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).
[edit] Citations
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
S
Pages in category "Standard ML"
The following 100 pages are in this category, out of 100 total.







