This note provides a brief introduction to -calculi and their application to concurrent and distributed programming. Chapter 1 introduces a simple -calculus and discusses the choice of primitives, operational semantics (in terms of reductions and of indexed early labelled transitions), operational equivalences, Pict-style programming and typing. Chapter 2 goes on to discuss the application of these ideas to distributed systems, looking informally at the design of distributed -calculi with grouping and interaction primitives. Chapter 3 returns to typing, giving precise de nitions for a simple type system and soundness results for the labelled transition semantics. Finally, Chapters 4 and 5 provide a model development of the metatheory, giving rst an outline and then detailed proofs of the results stated earlier. The note can be read in the partial order 1:(2 + 3 + 4:5).
Mendeley saves you time finding and organizing research
There are no full text links
Choose a citation style from the tabs below