digplanet beta 1: Athena
Share digplanet:

Agriculture

Applied sciences

Arts

Belief

Business

Chronology

Culture

Education

Environment

Geography

Health

History

Humanities

Language

Law

Life

Mathematics

Nature

People

Politics

Science

Society

Technology

ML
Paradigm(s) multi-paradigm: imperative, functional
Designed by Robin Milner & others at the University of Edinburgh
Appeared in 1973
Typing discipline static, strong, inferred, safe
Dialects Standard ML, OCaml
Influenced by ISWIM
Influenced Miranda, Haskell, Cyclone, C++, F#, Clojure, Felix, Opa, Erlang, Scala

ML is a general-purpose functional programming language developed by Robin Milner and others in the early 1970s at the University of Edinburgh,[1] whose syntax is inspired by ISWIM. Historically, ML stands for metalanguage: it was conceived to develop proof tactics in the LCF theorem prover (whose language, pplambda, a combination of the first-order predicate calculus and the simply typed polymorphic lambda calculus, had ML as its metalanguage). It is known for its use of the Hindley–Milner type inference algorithm, which can automatically infer the types of most expressions without requiring explicit type annotations. Additionally, the use of this algorithm ensures type safety—there is a formal proof that a well-typed ML program does not cause runtime type errors.[2]

Overview[edit]

ML is often referred to as an impure functional language, because it encapsulates side-effects, unlike purely functional programming languages such as Haskell.

Features of ML include a call-by-value evaluation strategy, first-class functions, automatic memory management through garbage collection, parametric polymorphism, static typing, type inference, algebraic data types, pattern matching, and exception handling.

Unlike Haskell, ML uses eager evaluation, which means that all subexpressions are always evaluated. However, lazy evaluation can be achieved through the use of closures. Thus one can create and use infinite streams as in Haskell, but their expression is indirect.

Today there are several languages in the ML family; the two major dialects are Standard ML (SML) and Caml, but others exist, including F#  — a language that Microsoft supports for their .NET platform. Ideas from ML have influenced numerous other languages, like Haskell, Cyclone[citation needed], and Nemerle.

ML's strengths are mostly applied in language design and manipulation (compilers, analyzers, theorem provers), but it is a general-purpose language also used in bioinformatics, financial systems, and applications including a genealogical database, a peer-to-peer client/server program, etc.[citation needed]

ML uses static scoping rules.

Examples[edit]

The following examples use the syntax of Standard ML. The other most widely used ML dialect, OCaml, differs in various insubstantial ways.

Factorial[edit]

The factorial function expressed as pure ML:

fun fac (0 : int) : int = 1
  | fac (n : int) : int = n * fac (n - 1)

This describes the factorial as a recursive function, with a single terminating base case. It is similar to the descriptions of factorials found in mathematics textbooks. Much of ML code is similar to mathematics in facility and syntax.

Part of the definition shown is optional, and describes the types of this function. The notation E : t can be read as expression E has type t. For instance, the argument n is assigned type integer (int), and fac (n : int), the result of applying fac to the integer n, also has type integer. The function fac as a whole then has type function from integer to integer (int -> int). Thanks to type inference, the type annotations can be omitted and will be derived by the compiler. Rewritten without the type annotations, the example looks like:

fun fac 0 = 1
  | fac n = n * fac (n - 1)

The function also relies on pattern matching, an important part of ML programming. Note that parameters of a function are not necessarily in parentheses but separated by spaces. When the function's argument is 0 (zero) it will return the integer 1 (one). For all other cases the second line is tried. This is the recursion, and executes the function again until the base case is reached.

This implementation of the factorial function is not guaranteed to terminate, since a negative argument causes an infinite descending chain of recursive calls. A more robust implementation would check for a nonnegative argument before recursing, as follows:

fun fact n = let
  fun fac 0 = 1
    | fac n = n * fac (n - 1)
  in
    if (n < 0) then raise Fail "negative argument"
    else fac n
  end

The problematic case (when n is negative) demonstrates a use of ML's exception system.

The function can be improved further by writing its inner loop in a tail-recursive style, such that the call stack need not grow in proportion to the number of function calls. This is achieved by adding an extra, "accumulator", parameter to the inner function. At last, we arrive at

fun factorial n = let
  fun fac (0, acc) = acc
    | fac (n, acc) = fac (n - 1, n * acc)
  in
    if (n < 0) then raise Fail "negative argument"
    else fac (n, 1)
  end

List reverse[edit]

The following function "reverses" the elements in a list. More precisely, it returns a new list whose elements are in reverse order compared to the given list.

fun reverse [] = []
  | reverse (x::xs) = (reverse xs) @ [x]

This implementation of reverse, while correct and clear, is inefficient, requiring quadratic time for execution. The function can be rewritten to execute in linear time in the following more efficient, though less easy-to-read, style:

fun reverse xs = let
  fun rev [] acc = acc
    | rev (hd::tl) acc = rev tl (hd::acc)
in
  rev xs []
end

Notably, this function is an example of parametric polymorphism. That is, it can consume lists whose elements have any type, and return lists of the same type.

See also[edit]

Dialects[edit]

  • OCaml, a popular implementation of Caml with support for object-oriented programming
  • Standard ML, a formally specified dialect of ML, and its implementations:
  • Lazy ML, an experimental lazily evaluated ML dialect from the early 1980s that paved the way for compilation of call-by-need languages such as Haskell and Clean
  • Dependent ML, an extension of ML with dependent typing that led to the development of ATS
  • Rpal, an educational language related to ML

Other languages and tools[edit]

Books[edit]

References[edit]

  1. ^ Gordon, Michael J. C. (1996). "From LCF to HOL: a short history". Retrieved 2007-10-11. 
  2. ^ Robin Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17(3):348 – 375, 1978.

External links[edit]


Original courtesy of Wikipedia: http://en.wikipedia.org/wiki/ML_(programming_language) — Please support Wikipedia.
A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia.
45500 videos foundNext > 

Programming Languages: Standard ML - 1

First lecture on Standard ML.

11. ML Versus Racket

Video from Coursera - University of Washington - Course: Programming Languages: https://www.coursera.org/course/proglang.

Programming Languages: Standard ML - 2

Second lecture on Standard ML.

Programming Languages: Standard ML - 5

Fifth lecture on Standard ML.

Programming Languages: Standard ML - 8

Eighth lecture on Standard ML.

Programming Languages: Standard ML - 7

Seventh lecture on Standard ML.

Programming Languages: Standard ML - 4

Fourth lecture on Standard ML.

Programming Languages: Standard ML - 3

Third lecture on Standard ML.

Effective ML by Yaron Minsky

Programming Languages: Standard ML - 6

Sixth lecture on Standard ML.

45500 videos foundNext > 

We're sorry, but there's no news about "ML (programming language)" right now.

Loading

Oops, we seem to be having trouble contacting Twitter

Talk About ML (programming language)

You can talk about ML (programming language) with people all over the world in our discussions.

Support Wikipedia

A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia. Please add your support for Wikipedia!