The name "Erlang", attributed to Bjarne Däcker, has been presumed by those working on the telephony switches (for whom the language was designed) to be a reference to Danish mathematician and engineer Agner Krarup Erlang or the ubiquitous use of the unit named for him, and (initially at least) simultaneously as a syllabic abbreviation of "Ericsson Language".[4][7]

Erlang was designed with the aim of improving the development of telephony applications. The initial version of Erlang was implemented in Prolog and was influenced by the programming language PLEX used in earlier Ericsson exchanges. By 1988 Erlang had proven that it was suitable for prototyping telephone exchanges, but the Prolog interpreter was far too slow. One group within Ericsson estimated that it would need to be 40 times faster in order to be suitable for production use. In 1992 work began on the BEAM virtual machine which compiles Erlang to C using a mix of natively compiled code and threaded code to strike a balance between performance and disk space.[8] According to Armstrong, the language went from lab product to real applications following the collapse of the next-generation AXE exchange named AXE-N in 1995. As a result, Erlang was chosen for the next ATM exchangeAXD.[4]

In 1998 Ericsson announced the AXD301 switch, containing over a million lines of Erlang and reported to achieve a high availability of nine "9"s.[9] Shortly thereafter, Ericsson Radio Systems banned the in-house use of Erlang for new products, citing a preference for non-proprietary languages. The ban caused Armstrong and others to leave Ericsson.[10] The implementation was open-sourced at the end of the year.[4] Ericsson eventually lifted the ban; it re-hired Armstrong in 2004.[10]

Erlang has now been adopted by companies worldwide, including Nortel and T-Mobile. Erlang is used in Ericsson’s support nodes, and in GPRS, 3G and LTE mobile networks worldwide.[13]

As Tim Bray, director of Web Technologies at Sun Microsystems, expressed in his keynote at OSCON in July 2008:

If somebody came to me and wanted to pay me a lot of money to build a large scale message handling system that really had to be up all the time, could never afford to go down for years at a time, I would unhesitatingly choose Erlang to build it in.

-module(fact).% This is the file 'fact.erl', the module and the filename must match-export([fac/1]).% This exports the function 'fac' of arity 1 (1 parameter, no type, no name)fac(0)->1;% If 0, then return 1, otherwise (note the semicolon ; meaning 'else')fac(N)whenN>0,is_integer(N)->N*fac(N-1).% Recursively determine, then return the result% (note the period . meaning 'endif' or 'function end')%% This function will crash if anything other than a nonnegative integer is given.%% It illustrates the "Let it crash" philosophy of Erlang.

A Fibonacci algorithm implemented in Erlang (Note: This is only for demonstrating the Erlang syntax. This algorithm is rather slow.[15]):

-module(fib).% This is the file 'fib.erl', the module and the filename must match-export([fib/1]).% This exports the function 'fib' of arity 1fib(1)->1;% If 1, then return 1, otherwise (note the semicolon ; meaning 'else')fib(2)->1;% If 2, then return 1, otherwisefib(N)->fib(N-2)+fib(N-1).

%% qsort:qsort(List)%% Sort a list of items-module(qsort).% This is the file 'qsort.erl'-export([qsort/1]).% A function 'qsort' with 1 parameter is exported (no type, no name)qsort([])->[];% If the list [] is empty, return an empty list (nothing to sort)qsort([Pivot|Rest])->% Compose recursively a list with 'Front' for all elements that should be before 'Pivot'% then 'Pivot' then 'Back' for all elements that should be after 'Pivot'qsort([Front||Front<-Rest,Front<Pivot])++[Pivot]++qsort([Back||Back<-Rest,Back>=Pivot]).

The above example recursively invokes the function qsort until nothing remains to be sorted. The expression [Front || Front <- Rest, Front < Pivot] is a list comprehension, meaning "Construct a list of elements Front such that Front is a member of Rest, and Front is less than Pivot." ++ is the list concatenation operator.

A comparison function can be used for more complicated structures for the sake of readability.

The following code would sort lists according to length:

% This is file 'listsort.erl' (the compiler is made this way)-module(listsort).% Export 'by_length' with 1 parameter (don't care about the type and name)-export([by_length/1]).by_length(Lists)->% Use 'qsort/2' and provides an anonymous function as a parameterqsort(Lists,fun(A,B)->length(A)<length(B)end).qsort([],_)->[];% If list is empty, return an empty list (ignore the second parameter)qsort([Pivot|Rest],Smaller)->% Partition list with 'Smaller' elements in front of 'Pivot' and not-'Smaller' elements% after 'Pivot' and sort the sublists.qsort([X||X<-Rest,Smaller(X,Pivot)],Smaller)++[Pivot]++qsort([Y||Y<-Rest,not(Smaller(Y,Pivot))],Smaller).

Here again, a Pivot is taken from the first parameter given to qsort() and the rest of Lists is named Rest. Note that the expression

[X||X<-Rest,Smaller(X,Pivot)]

is no different in form from

[Front||Front<-Rest,Front<Pivot]

(in the previous example) except for the use of a comparison function in the last part, saying "Construct a list of elements X such that X is a member of Rest, and Smaller is true", with Smaller being defined earlier as

fun(A,B)->length(A)<length(B)end

Note also that the anonymous function is named Smaller in the parameter list of the second definition of qsort so that it can be referenced by that name within that function. It is not named in the first definition of qsort, which deals with the base case of an empty list and thus has no need of this function, let alone a name for it.

Integers are written as sequences of decimal digits, for example, 12, 12375 and -23427 are integers. Integer arithmetic is exact and only limited by available memory on the machine. (This is called arbitrary-precision arithmetic.)

Atoms

Atoms are used within a program to denote distinguished values. They are written as strings of consecutive alphanumeric characters, the first character being lowercase. Atoms can contain any character if they are enclosed within single quotes and an escape convention exists which allows any character to be used within an atom.

References are globally unique symbols whose only property is that they can be compared for equality. They are created by evaluating the Erlang primitive make_ref().

Binaries

A binary is a sequence of bytes. Binaries provide a space-efficient way of storing binary data. Erlang primitives exist for composing and decomposing binaries and for efficient input/output of binaries.

Pids

Pid is short for process identifier – a Pid is created by the Erlang primitive spawn(...) Pids are references to Erlang processes.

Ports

Ports are used to communicate with the external world. Ports are created with the built-in function open_port. Messages can be sent to and received from ports, but these messages must obey the so-called "port protocol."

Funs

Funs are function closures. Funs are created by expressions of the form: fun(...) -> ... end.

And three compound data types:

Tuples

Tuples are containers for a fixed number of Erlang data types. The syntax {D1,D2,...,Dn} denotes a tuple whose arguments are D1, D2, ... Dn. The arguments can be primitive data types or compound data types. Any element of a tuple can be accessed in constant time.

Lists

Lists are containers for a variable number of Erlang data types. The syntax [Dh|Dt] denotes a list whose first element is Dh, and whose remaining elements are the list Dt. The syntax [] denotes an empty list. The syntax [D1,D2,..,Dn] is short for [D1|[D2|..|[Dn|[]]]]. The first element of a list can be accessed in constant time. The first element of a list is called the head of the list. The remainder of a list when its head has been removed is called the tail of the list.

Maps

Maps contain a variable number of key-value associations. The syntax is#{Key1=>Value1,...,KeyN=>ValueN}.

Strings are written as doubly quoted lists of characters. This is syntactic sugar for a list of the integer ASCII codes for the characters in the string. Thus, for example, the string "cat" is shorthand for [99,97,116]. It has partial support for Unicode strings.[17]

Records

Records provide a convenient way for associating a tag with each of the elements in a tuple. This allows one to refer to an element of a tuple by name and not by position. A pre-compiler takes the record definition and replaces it with the appropriate tuple reference.

Erlang has no method of defining classes, although there are external libraries available.[18]

Erlang's main strength is support for concurrency. It has a small but powerful set of primitives to create processes and communicate among them. Erlang is conceptually similar to the occam programming language, though it recasts the ideas of communicating sequential processes (CSP) in a functional framework and uses asynchronous message passing.[19] Processes are the primary means to structure an Erlang application. They are neither operating system processes nor operating system threads, but lightweight processes that are scheduled by Erlang's BEAM VM. Like operating system processes (but unlike operating system threads), they share no state with each other. The estimated minimal overhead for each is 300 words.[20] Thus, many processes can be created without degrading performance. A benchmark with 20 million processes has been successfully performed.[21] Erlang has supported symmetric multiprocessing since release R11B of May 2006.

While threads require external library support in most languages, Erlang provides language-level features for creating and managing processes with the aim of simplifying concurrent programming. Though all concurrency is explicit in Erlang, processes communicate using message passing instead of shared variables, which removes the need for explicit locks (a locking scheme is still used internally by the VM[22]).

Inter-process communication works via a shared-nothingasynchronousmessage passing system: every process has a "mailbox", a queue of messages that have been sent by other processes and 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 and 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.

The code example below shows the built-in support for distributed processes:

% Create a process and invoke the function web:start_server(Port, MaxConnections)ServerProcess=spawn(web,start_server,[Port,MaxConnections]),% Create a remote process and invoke the function% web:start_server(Port, MaxConnections) on machine RemoteNodeRemoteProcess=spawn(RemoteNode,web,start_server,[Port,MaxConnections]),% Send a message to ServerProcess (asynchronously). The message consists of a tuple% with the atom "pause" and the number "10".ServerProcess!{pause,10},% Receive messages sent to this processreceivea_message->do_something;{data,DataContent}->handle(DataContent);{hello,Text}->io:format("Got hello message: ~s",[Text]);{goodbye,Text}->io:format("Got goodbye message: ~s",[Text])end.

As the example shows, processes may be created on remote nodes, and communication with them is transparent in the sense that communication with remote processes works exactly as 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 then take action, such as for instance starting a new process that takes over the old process's task.[23][24]

The Ericsson Erlang implementation loads virtual machine bytecode which is converted to threaded code at load time. It also includes a native code compiler on most platforms, developed by the High Performance Erlang Project (HiPE) at Uppsala University. Since October 2001 the HiPE system is fully integrated in Ericsson's Open Source Erlang/OTP system.[25] It also supports interpreting, directly from source code via abstract syntax tree, via script as of R11B-5 release of Erlang.

Erlang supports language-level Dynamic Software Updating. To implement this, code is loaded and managed as "module" units; the module is a compilation unit. The system can keep two versions of a module in memory at the same time, and processes can concurrently run code from each. The versions are referred to as the "new" and the "old" version. A process will not move into the new version until it makes an external call to its module.

An example of the mechanism of hot code loading:

%% A process whose only job is to keep a counter.%% First version-module(counter).-export([start/0,codeswitch/1]).start()->loop(0).loop(Sum)->receive{increment,Count}->loop(Sum+Count);{counter,Pid}->Pid!{counter,Sum},loop(Sum);code_switch->?MODULE:codeswitch(Sum)% Force the use of 'codeswitch/1' from the latest MODULE versionend.codeswitch(Sum)->loop(Sum).

For the second version, we add the possibility to reset the count to zero.

%% Second version-module(counter).-export([start/0,codeswitch/1]).start()->loop(0).loop(Sum)->receive{increment,Count}->loop(Sum+Count);reset->loop(0);{counter,Pid}->Pid!{counter,Sum},loop(Sum);code_switch->?MODULE:codeswitch(Sum)end.codeswitch(Sum)->loop(Sum).

Only when receiving a message consisting of the atom 'code_switch' will the loop execute an external call to codeswitch/1 (?MODULE is a preprocessor macro for the current module). If there is a new version of the "counter" module in memory, then its codeswitch/1 function will be called. The practice of having a specific entry-point into a new version allows the programmer to transform state to what is required in the newer version. In our example we keep the state as an integer.

In practice, systems are built up using design principles from the Open Telecom Platform which leads to more code upgradable designs. Successful hot code loading is a tricky subject; Code needs to be written with care to make use of Erlang's facilities.

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

Since the open source release, Erlang has been used by several firms worldwide, including Nortel and T-Mobile.[26] Although Erlang was designed to fill a niche and has remained an obscure language for most of its existence, its popularity is growing due to demand for concurrent services.[27][28] Erlang has found some use in fielding MMORPG servers.[29]

^"Who uses Erlang for product development?". Frequently asked questions about Erlang. Retrieved 16 July 2007. The largest user of Erlang is (surprise!) Ericsson. Ericsson use it to write software used in telecommunications systems. Many dozens of projects have used it, a particularly large one is the extremely scalable AXD301 ATM switch. Other commercial users listed as part of the FAQ include: Nortel, Deutsche Flugsicherung (the German national air traffic control organisation), and T-Mobile.

^"Programming Erlang". Retrieved 13 December 2008. Virtually all language use shared state concurrency. This is very difficult and leads to terrible problems when you handle failure and scale up the system...Some pretty fast-moving startups in the financial world have latched onto Erlang; for example, the Swedish www.kreditor.se.

^"Erlang, the next Java". Retrieved 8 October 2008. I do not believe that other languages can catch up with Erlang anytime soon. It will be easy for them to add language features to be like Erlang. It will take a long time for them to build such a high-quality VM and the mature libraries for concurrency and reliability. So, Erlang is poised for success. If you want to build a multicore application in the next few years, you should look at Erlang.[dead link]