Category:Standard ML: Difference between revisions

From Rosetta Code
Content added Content deleted
m (Links)
(Added some features, type expression looks implicit (check me))
Line 1: Line 1:
{{language
{{language|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.
|strength=strong
|checking=static
|express=implicit}}'''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).
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).

Revision as of 13:55, 26 June 2009

Language
Standard ML
This programming language may be used to instruct a computer to perform a task.
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.

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

Citations

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 301 total.

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