By Joe Armstrong, Robert Virding, Mike Williams
Erlang is a concurrent, practical programming language designed for programming huge business actual time platforms. The language is untyped and has a trend matching syntax. services are written as a collection of recursion equations and the language has particular concurrency and asynchronous message passing. Written in an academic kind, the emphasis is on studying via instance and a few renowned difficulties in designing and programming concurrent fault-tolerant real-time platforms are illstrated.New chapters on dispensed Programming, disbursed Programming innovations and dispensed information.
Read or Download Concurrent Programming in Erlang PDF
Best software books
This consultant identifies a few of the key difficulties hampering good fortune during this box. Covers administration, all levels of the software program lifecycle, caliber, learn, and extra. writer offers ten universal fallacies that support aid the fifty-five proof. Softcover.
Alt. ISBN:9780321117427, 0321117425, 9780321117427
This publication offers leading edge suggestions for the implementation of Sigma-Delta Modulation (SDM) established Analog-to-Digital Conversion (ADC), required for the following iteration of instant hand held terminals. those units can be according to the so-called multi-standard transceiver chipsets, built-in in nanometer CMOS applied sciences.
- Software Directory for Molecular Biologists: A complete guide to the selection of computer software for the management and analysis of molecular sequences
- Absolute Beginner's Guide to WordPerfect® 11
- iPad App Directory Volume 5
- The implementation of functional programming languages
Extra resources for Concurrent Programming in Erlang
These represent two entirely different functions – this is in contrast to languages such as C or Pascal where a function name can only occur once with a fixed number of arguments. 2 Clauses Each function is built from a number of clauses. The clauses are separated by semicolons ‘;’. Each individual clause consists of a clause head, an optional guard and a body. These are described below. 3 Clause heads The head of a clause consists of a function name followed by a number of arguments separated by commas.
Using such a schema we could, for example, write a function which returns a list where every even element in the list has been squared and every odd element removed: funny(L) -> funny(L, ). 50 Programming with Lists funny([H|T], Accumulator) -> case even(H) of true -> funny(T, [H*H|Accumulator]); false -> funny(T, Accumulator) end; funny(, Accumulator) -> Accumulator. Thus for example: > lists:funny([1,2,3,4,5,6]) [36,16,4] Note that in this case the elements in the resulting list are in the reverse order to those from which they were derived in the original list.
X,a] > sets:intersection(S3, T3). [a] 10> sets:union(S3,T3). [b,x,a] This implementation is not particularly efficient, but it is sufficiently simple to be (hopefully) correct. At a later stage it could be replaced by a more efficient version. 3) we see how a list of prime numbers can be generated using the sieve of Eratosthenes algorithm. -module(siv). -compile(export_all). range(N, N) -> [N]; range(Min, Max) -> [Min | range(Min+1, Max)]. remove_multiples(N, [H|T]) when H rem N == 0 -> remove_multiples(N, T); remove_multiples(N, [H|T]) -> [H | remove_multiples(N, T)]; remove_multiples(_, ) -> .
Concurrent Programming in Erlang by Joe Armstrong, Robert Virding, Mike Williams