From Wikipedia, the free encyclopedia

Erlang
Paradigm	multi-paradigm: concurrent, functional
Appeared in	1987
Designed by	Ericsson
Developer	Ericsson
Typing discipline	dynamic, strong
Major implementations	Erlang
Influenced	Scala
License	Modified MPL

Erlang is a general-purpose concurrent programming language and runtime system. The sequential subset of Erlang is a functional language, with strict evaluation, single assignment, and dynamic typing. For concurrency it follows the Actor model. It was designed by Ericsson to support distributed, fault-tolerant, soft-real-time, non-stop applications. It supports hot swapping so code can be changed without stopping a system. Erlang was originally a proprietary language within Ericsson, but was released as open source in 1998. The Ericsson implementation primarily runs interpreted virtual machine code, but it also includes a native code compiler (not supported on all platforms), developed by the High-Performance Erlang Project (HiPE) at Uppsala University. It also now supports interpretation via escript as of r11b-4.

Creating and managing processes is trivial in Erlang, whereas threads are considered a complicated and error prone topic in most languages. Though all concurrency is explicit in Erlang, processes communicate using message passing instead of shared variables, which removes the need for locks.

Erlang is named after A. K. Erlang. It is sometimes thought that its name is an abbreviation of Ericsson Language, owing to its heavy use inside Ericsson. According to Bjarne Däcker, who headed the Computer Science Lab at the time, this duality is intentional.[1]

Contents 1 Functional language 2 Concurrency and distribution oriented language 3 Distribution 4 See also 5 Notes 6 Further reading 7 External links

Code looks like this:

-module(fact).
-export([fac/1]).

fac(0) -> 1;
fac(N) when N > 0 -> N * fac(N-1).

Below is an implementation of a Quicksort algorithm.

%% quicksort:qsort(List)
%% Sort a list of items
-module(quicksort).
-export([qsort/1]).

qsort([]) -> [];
qsort([Pivot|Rest]) ->
    qsort([ X || X <- Rest, X < Pivot]) ++ [Pivot] ++ qsort([ Y || Y <- Rest, Y >= Pivot]).

The above example recursively invokes the function qsort until nothing remains to be sorted. The expression [ X || X <- Rest, X < Pivot] means “Choose all X where X is a member of Rest and X is less than Pivot”, resulting in a very easy way of handling lists. Since you can evaluate any boolean expression between two different datatypes, the evaluation is straightforward: for example, 1 < a will return true.

A compare function can be used, however, if the order on which Erlang bases its return value (true or false) needs to be changed. If, for example, we want an ordered list where a < 1 evaluates true.

The following code would sort lists according to length:

-module(listsort).
-export([by_length/1]).

by_length(Lists) ->
    F = fun(A,B) when is_list(A), is_list(B) ->
            length(A) < length(B)
        end,
    qsort(Lists, F).

 qsort([], _)-> [];
 qsort([Pivot|Rest], Smaller) ->
     qsort([ X || X <- Rest, Smaller(X,Pivot)], Smaller)
     ++ [Pivot] ++
     qsort([ Y ||Y <- Rest, not(Smaller(Y, Pivot))], Smaller).

Erlang's main strength is support for concurrency. It has a small but powerful set of primitives to create processes and communicate between them. Processes are the primary means to structure an Erlang application. Erlang processes are neither OS processes nor OS threads, but lightweight processes somewhat similar to Java's original “green threads” (the JVM now uses native threads). Like operating system processes (and unlike green and O/S threads) they have no shared state between them. The estimated minimal overhead for each is 300 bytes, so many of them can be created without degrading performance (a benchmark with 20 million processes was tried^[1]). Erlang has supported symmetric multiprocessing since release R11B of May 2006.

Process communication is done via a share-nothing asynchronous message-passing system: every process has a “mailbox”, a queue of messages sent by other processes, that are not yet consumed. A process uses the receive primitive to retrieve messages that match desired patterns. A message-handling routine tests messages in turn against each pattern, until one of them matches. When the message is consumed (removed from the mailbox) the process resumes execution. A message may comprise any Erlang structure, including primitives (integers, floats, characters, atoms), tuples, lists, and functions.

Code examples:

 Pid = spawn(Mod, Func, Args)       % execute function Func as new process with arguments Args
 Pid = spawn(Node, Mod, Func, Args) % execute function Func in remote node Node with arguments Args

 Pid ! a_message      % send message to the process (asynchronously)

 receive       % receive message sent to this process
   a_message -> do_something;
   {data, Data_content} -> do_something_else(); % This is a tuple of a type atom and some data
   {hello, Text} -> io:format("Got hello message: ~s", [Text]);
   {goodbye, Text} -> io:format("Got goodbye message: ~s", [Text])
 end.

There is also built-in support for distributed processes. Processes may be created on remote nodes, and communication with them is transparent (i.e. the communication with remote processes is done exactly as the communication with local processes).

Concurrency supports the primary method of error-handling in Erlang. When a process crashes, it neatly exits and sends a message to the controlling process which can take action. This way of error handling may increase maintainability and reduce complexity of code.

Erlang was released by Ericsson as open-source to ensure its independence from a single vendor and to increase awareness of the language. Distribution of the language together with libraries and the real-time distributed database Mnesia is the Open Telecom Platform (OTP). Ericsson and a few other companies offer commercial support for Erlang.

Since it was released as open source in 1998 it has been used by several companies world-wide, including Amazon.com, Nortel and T-Mobile^[2], although it has not become a widespread programming language.

As of 2007, Erlang is under active development with regular releases. It is available for several Unix-like operating systems and Microsoft Windows.

• ejabberd, an XMPP/Jabber instant messaging server written in Erlang that powers jabber.org
• Wings 3D, 3D modeller written in Erlang.
• Yaws (Yet Another Web Server), a web server written in Erlang.
• Tsung, a high-performance benchmarking tool written in Erlang.
• ErlLounge, Gatherings where Erlang is discussed.
• CouchDB, a document-based database written in Erlang.
• SimpleDB, Amazon.com's document-based database written in Erlang

• Joe Armstrong (2003). "Making reliable distributed systems in the presence of software errors". Ph.D. Dissertation. The Royal Institute of Technology, Stockholm, Sweden.
• Joe Armstrong (2007). “Programming Erlang, Software for a Concurrent World”. Pragmatic Programmers.
• Mattsson, H., Nilsson, H., Wikstrom, C.: “Mnesia - A distributed robust DBMS for telecommunications applications.” First International Workshop on Practical Aspects of Declarative Languages (PADL'99) (1999) pages 152-163
• J. Armstrong, R. Virding, C. Wikström, M. Williams (Prentice Hall, 1996, ISBN 0-13-508301-X) "Concurrent Programming in Erlang"

• Open Source Erlang website
• Ericsson's Erlang website
• Early history of Erlang (PDF)
• High-Performance Erlang website
• trapexit “Your Last Stop for Erlang Information”
• CEAN The Comprehensive Erlang Archive Network
• Erlang Style Concurrency
• Erlang: The Movie (google video) (high quality version)
• Erlang at the Open Directory Project