Category:Standard ML: Difference between revisions

From Rosetta Code
Content added Content deleted
m (Reverted edits by 134.174.13.235 (Talk); changed back to last version by IanOsgood)
(Added Programming Language template)
Line 1: Line 1:
{{Programming Language}}'''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.
[[Category:Solutions by Programming Language]]
'''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 03:40, 8 November 2007

Programming Language
This is a programming language. It may be used to instruct computers to accomplish a variety of tasks which may or may not be domain-specific.

Listed below are all of the tasks on Rosetta Code which have been solved using this programming language.


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:

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)