Category:Standard ML
Standard ML
This programming language may be used to instruct a computer to perform a task.
Listed below are all of the tasks on Rosetta Code which have been solved using 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: 

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 generalpurpose, modular, functional programming language with compiletime 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 theoremproving 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.
@
 Standard ML Implementations (3 P)
 Standard ML User (17 P)
Pages in category "Standard ML"
The following 200 pages are in this category, out of 289 total.
(previous page) (next page)A
 A+B
 ABC problem
 Abstract type
 Accumulator factory
 Ackermann function
 Algebraic data types
 Align columns
 Animation
 Anonymous recursion
 Apply a callback to an array
 Arbitraryprecision integers (included)
 Arithmetic evaluation
 Arithmeticgeometric mean
 Arithmetic/Complex
 Arithmetic/Integer
 Array concatenation
 Array length
 Arrays
 Assertions
 Averages/Arithmetic mean
 Averages/Root mean square
B
C
 Calculating the value of e
 Cartesian product of two or more lists
 Casesensitivity of identifiers
 Catalan numbers
 Catamorphism
 Character codes
 Check input device is a terminal
 Check output device is a terminal
 Check that file exists
 Church numerals
 Closures/Value capture
 Color of a screen pixel
 Combinations
 Combinations with repetitions
 Comma quibbling
 Commandline arguments
 Comments
 Compiler/lexical analyzer
 Compound data type
 Concurrent computing
 Constrained random points on a circle
 Continued fraction/Arithmetic/G(matrix ng, continued fraction n)
 Continued fraction/Arithmetic/G(matrix ng, continued fraction n1, continued fraction n2)
 Convert seconds to compound duration
 Convex hull
 Copy a string
 Copy stdin to stdout
 Count in octal
 Count occurrences of a substring
 Create a file
 Create a twodimensional array at runtime
 Create an HTML table
 Currying
D
E
F
 Factorial
 Factors of an integer
 Fibonacci sequence
 File input/output
 File modification time
 File size
 Filter
 Find common directory path
 Find limit of recursion
 Firstclass functions
 FizzBuzz
 Flatten a list
 FloydWarshall algorithm
 Fork
 Formatted numeric output
 Forward difference
 Fractal tree
 Function composition
 Function definition
G
H
I
K
L
 Leap year
 Least common multiple
 Left factorials
 Linear congruential generator
 Linux CPU utilization
 Literals/Integer
 Literals/String
 Logical operations
 Long literals, with continuations
 Longest common prefix
 Longest common suffix
 Longest increasing subsequence
 Loop over multiple arrays simultaneously
 Loops/Foreach
 Loops/Increment loop index within loop body
 Loops/Infinite
 Loops/While
 Ludic numbers
 Luhn test of credit card numbers
M
N
P
 Palindrome detection
 Parallel calculations
 Parametric polymorphism
 Parse commandline arguments
 Parsing/Shuntingyard algorithm
 Pointers and references
 Poker hand analyser
 Power set
 Primality by trial division
 Prime decomposition
 Priority queue
 Program name
 Program termination
 Pseudorandom numbers/PCG32