Making reliable distributed systems (using Erlang) [PhD by Armstrong J.

By Armstrong J.

Show description

Read Online or Download Making reliable distributed systems (using Erlang) [PhD Thesis] PDF

Best programming: programming languages books

Objektorientierte Programmiersprache C++: Vollständige Einführung anhand von Beispielen (VDI-Buch) (German Edition)

In diesem Werk werden alle Aspekte der Sprache C++ behandelt, deshalb ist das Buch ebenso für Einsteiger, mit oder ohne Vorkenntnisse über eine andere Programmiersprache, als auch für Umsteiger von anderen Programmiersprachen bzw. C-Programmierer geeignet. Die Darstellung der Sachverhalte erfolgt knapp und systematisch, die Beispiele sind kurz, prägnant und compiler- unabhängig und auf allen Rechnern mit C++ 2.

Additional info for Making reliable distributed systems (using Erlang) [PhD Thesis]

Sample text

22 CHAPTER 2. 2 Characteristics of a COPL COPLs are characterised by the following six properties: 1. COPLs must support processes. A process can be thought of as a self-contained virtual machine. 2. Several processes operating on the same machine must be strongly isolated. A fault in one processe should not adversely ecect another process, unless such interaction is explicitly programmed. 3. Each process must be identified by a unique unforgeable identifier. We will call this the Pid of the process.

7 Function bodies Function bodies are sequences of expressions. The value of a sequence of expressions is obtained by sequentially evaluating each element in the sequence. The value of the body is the result of evaluating the last expression in the sequence. For example, suppose we define a function to manipulate a bank account: deposit(Who, Money) -> Old = lookup(Who), New = Old + Money, insert(Who, New), New. The body of this function consists of a sequence of four statements. If we evaluate the expression deposit(joe, 25) then the function will be entered with bindings {Who → joe, Money → 10}.

If P is a constant then T must be the same constant. • If P is a free variable V then V is bound to T. Here are some examples: The pattern {P,abcd} matches the term {123,abcd} creating the binding P → 123. The pattern [H|T] matches the term "cat" creating the bindings H → 99 and T → [79,116]. The Pattern {abc,123} does not match the term {abc,124}. 4 Guards Guards are expressions involving only predicates. They are written immediately ader primitive patterns and introduced with the keyword when.

Download PDF sample

Rated 4.39 of 5 – based on 23 votes