Category:Standard ML

From Rosetta Code
Language
Standard ML
This programming language may be used to instruct a computer to perform a task.
Official website
Execution method: Compiled (machine code)
Garbage collected: Yes
Parameter passing methods: By value
Type strength: Strong
Type expression: Implicit
Type checking: Static
See Also:


Listed below are all of the tasks on Rosetta Code which have been solved using Standard ML.
This page uses content from Wikipedia. The original article was at Standard ML. The list of authors can be seen in the page history. As with Rosetta Code, the text of Wikipedia is available under the GNU FDL. (See links for details on variance)

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).

Subcategories

This category has the following 3 subcategories, out of 3 total.

Pages in category "Standard ML"

The following 200 pages are in this category, out of 296 total.

(previous page) (next page)
(previous page) (next page)