Erlang (programming language)

Erlang

Paradigm(s)	multi-paradigm: concurrent, functional
Appeared in	1986
Designed by	Ericsson
Developer	Ericsson
Stable release	R16B [1] (27 February 2013; 19 days ago (2013-02-27))
Typing discipline	dynamic, strong
Major implementations	Erlang
Influenced by	Prolog, SmallTalk
Influenced	F#, Clojure, Rust, Scala, Opa, Reia
License	Modified MPL
www.erlang.org Erlang Programming at Wikibooks

Erlang (pron.: /ˈɜrlæŋ/ ER-lang) is a general-purpose concurrent, garbage-collected programming language and runtime system. The sequential subset of Erlang is a functional language, with strict evaluation, single assignment, and dynamic typing. It was designed by Ericsson to support distributed, fault-tolerant, soft-real-time, non-stop applications. It supports hot swapping, so that code can be changed without stopping a system.^[2]

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 locks.

The first version was developed by Joe Armstrong in 1986.^[3] It was originally a proprietary language within Ericsson, but was released as open source in 1998.

History

The name "Erlang", attributed to Bjarne Däcker, has been understood as a reference to Danish mathematician and engineer Agner Krarup Erlang, and (initially at least) simultaneously as a portmanteau of "Ericsson Language".^[3][4]

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. 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 exchange AXD.^[3]

In 1998, the Ericsson AXD301 switch was announced, containing over a million lines of Erlang, and reported to achieve a reliability of nine "9"s.^[5] Shortly thereafter, Erlang was banned within Ericsson Radio Systems for new products, citing a preference for non-proprietary languages. The ban caused Armstrong and others to leave Ericsson.^[6] The implementation was open sourced at the end of the year.^[3] The ban at Ericsson was eventually lifted, and Armstrong was re-hired by Ericsson in 2004.^[6]

In 2006, native symmetric multiprocessing support was added to the runtime system and virtual machine.^[3]

Philosophy

Quoting^[7] Mike Williams, one of the three inventors of Erlang:^[8]

1. Find the right methods—Design by Prototyping.
2. It is not good enough to have ideas, you must also be able to implement them and know they work.
3. Make mistakes on a small scale, not in a production project.

Functional programming examples

A factorial algorithm implemented in Erlang:

-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) when N > 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 something other than a positive integer is given.%% It illustrates the “Let it crash” philosophy of Erlang.

A sorting algorithm (similar to quicksort):

%% 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 of the type and name)-export([by_length/1]). by_length(Lists) -> % Use 'qsort/2' and provides an anonymous function as a parameter   qsort(Lists, fun(A,B) -> A < 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) -> A < 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.

Data types

Erlang has eight primitive data types:

1. Integers: 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.)
2. 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.
3. Floats: floating point numbers use the IEEE 754 64-bit representation. (Range: ±10³⁰⁸.)
4. References: 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().
5. 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.
6. Pids: Pid is short for process identifier—a Pid is created by the Erlang primitive spawn(...) Pids are references to Erlang processes.
7. Ports: ports are used to communicate with the external world. Ports are created with the built-in function (BIF) open_port. Messages can be sent to and received from ports, but these messages must obey the so-called "port protocol."
8. Funs : Funs are function closures. Funs are created by expressions of the form: fun(...) -> ... end.

And two compound data types:

1. 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. The elements of a tuple can be accessed in constant time.
2. 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.

Two forms of syntactic sugar are provided:

1. Strings : 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^[9]
2. Records : records provide a convenient way for associating a tag with each of the elements in a tuple. This allows us 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.^[10]

Concurrency and distribution orientation

Erlang's main strength is support for concurrency. It has a small but powerful set of primitives to create processes and communicate among them. Processes are the primary means to structure an Erlang application. Erlang processes loosely follow the communicating sequential processes (CSP) model^{[citation needed]}. They are neither operating system processes nor operating system threads, but lightweight processes. Like operating system processes (but unlike operating system threads) they have no shared state between them. The estimated minimal overhead for each is 300 words;^[11] thus many of them can be created without degrading performance: a benchmark with 20 million processes has been successfully performed.^[12] Erlang has supported symmetric multiprocessing since release R11B of May 2006.

Inter-process communication works via a shared-nothing asynchronous message 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 RemoteNode RemoteProcess = 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 process receive a_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 take action.^[13][14] This way of error handling increases maintainability and reduces complexity of code.^{[citation needed]}

Implementation

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.^[15] It also supports interpreting, directly from source code via abstract syntax tree, via script as of R11B-5 release of Erlang.

Hot code loading and modules

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 version end.   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 to make use of Erlang's facilities.

Distribution

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.^[16] 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.^[17][18] Erlang has found some use in fielding MMORPG servers.^[19]

Projects using Erlang

Projects using Erlang include:

• Database (distributed):
  • Cloudant, a database service based on the company's fork of CouchDB, BigCouch.
  • CouchDB, a document-based database that uses MapReduce
  • Couchbase Server (née Membase), database management system optimized for storing data behind interactive web applications
  • Riak, a distributed database
  • SimpleDB, a distributed database that is part of Amazon Web Services^[20]

• Chat:
  • ejabberd, an Extensible Messaging and Presence Protocol (XMPP) instant messaging server
    • Facebook Chat system,^[21] based on ejabberd^[22]
    • Tuenti chat is based on ejabberd^[23]

• CMS:
  • Zotonic, a Content Management System and Web-Framework

• Configuration management:
  • Chef (software), for which the core API server, originally written in Ruby, was completely re-written in version 11 in Erlang^[24]

• Web-frameworks:
  • ChicagoBoss, a Rails-like Web-Framework

• Queue:
  • RabbitMQ, an implementation of Advanced Message Queuing Protocol (AMQP)

• Desktop:
  • Wings 3D, a 3D subdivision modeller, used to model and texture polygon meshes.

• Web Servers:
  • Yaws web server.
  • Mochiweb light web server.
  • Misultin light web server.
  • Cowboy light web server.

• Tools
  • GitHub, a web-based hosting service for software development projects that use the Git version control system ^[25]

• Mobile:
  • WhatsApp, mobile messenger^[26]

• Enterprise:
  • Issuu, an online digital publisher ^[27]
  • Twitterfall, a service to view trends and patterns from Twitter^[28][29]

• Trading
  • Goldman Sachs, high-frequency trading programs.
  • Smarkets, sports betting exchange

• Gaming
  • Vendetta Online Naos game server ^[30]
  • Battlestar Galactica Online game server by Bigpoint
  • Call of Duty server core ^[31]

Companies using Erlang

Companies using Erlang in their production systems include:

• Amazon.com uses Erlang to implement SimpleDB, providing database services as a part of the Amazon Web Services offering.^{[citation needed]}

• Yahoo! uses it in its social bookmarking service, Delicious, which has more than 5 million users and 150 million bookmarked URLs.^{[citation needed]}

• Facebook uses Erlang to power the backend of its chat service, handling more than 100 million active users.^{[citation needed]} It can be observed in some of its HTTP response headers:

• T-Mobile uses Erlang in its SMS and authentication systems.^{[citation needed]}

• Motorola is using Erlang in call processing products in the public-safety industry.^{[citation needed]}

• Ericsson uses Erlang in its support nodes, used in GPRS and 3G mobile networks worldwide.^{[citation needed]}

• Linden Lab uses Erlang in its games.

References

Further reading

External links

• Official website
• Erlang at the Open Directory Project
• trapexit.org, site with much Erlang/OTP information
• Erlang: The Movie
• Learn You Some Erlang, tutorial for beginners
• erldocs.com, alternative topic documentation
• Joe Armstrong on Erlang, Software Engineering Radio Podcast