Erlang (programming language): Difference between revisions
imported>Eric Evers (→Syntax) |
imported>Eric Evers No edit summary |
||
| Line 4: | Line 4: | ||
==Syntax== | ==Syntax== | ||
Functions are defined by value and type and end with a period. Function domains are separated by semicolons. | |||
fact(0) -> 1; | |||
fact(N) -> | |||
fact(N-1)*N. | |||
==See also== | ==See also== | ||
Revision as of 07:25, 15 April 2008
The Erlang programming language is a strict functional language, a declarative language, and a general-purpose programming language which shares some syntax with prolog. It is considered declarative because it has the pattern matching syntax of prolog and list comprehensions. Because of its prowess at parallel programming it is particulary good at creating servers such as web servers or ftp servers with small amounts of code. It is a dynamically typed language. Armstrong also describes it as a concurrency oriented language. Erlang was developed in 1987 by Joe Armstrong and others (then of Ericsson) for use to program telephone networks. Ref: Joe Armstrong (2003). "Making reliable distributed systems in the presence of software errors". Ph.D. Dissertation. [1] New versions of Erlang are released by Ericsson on a yearly basis. At present(2008) there is increased interest in parallel programming languages because of the use of multicore microprocessors in personal computers.
Syntax
Functions are defined by value and type and end with a period. Function domains are separated by semicolons.
fact(0) -> 1;
fact(N) ->
fact(N-1)*N.