Category:Standard ML: Difference between revisions
Content added Content deleted
m (Links) |
(Added some features, type expression looks implicit (check me)) |
||
Line 1: | Line 1: | ||
{{language |
|||
⚫ | |||
|strength=strong |
|||
|checking=static |
|||
⚫ | |||
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). |