78 ;;Quote: mathematical functions are a good foundation for sequential computation; nothing comparable for concurrent programming

80 ;;Quote: shared memory invalidates the function-to-value view of the program-to-memory relationship; want interaction among peers

80 ;;Quote: if shared memory cells are processes then program variables are the names of channels of interaction

82 ;;Quote: combine Petri net theory with a compositional view of systems; like combining Turing machines with lambda-calculus

83 ;;Quote: interaction is the atom of behavior of the calculus of communication systems; i.e., passing a datum between processes

83+;;Quote: reduction is the atom of behavior of lambda-calculus; i.e., passing an argument to a function

84 ;;Quote: an interaction sends a message across a channel to a process's free variable

86 ;;Quote: the key idea of pi-calculus is naming or reference; concurrency requires the independent identity of its components

86 ;;Quote: pi-calculus expressions consist of names and processes; names may be a channel or a datum

86+;;Quote: an interaction transmits a name (a means of access) from one process to another

86 ;;Quote: transmitting a name via a pi-calculus interaction is atomic; since no structure; unlike reduction

86 ;;Quote: traditionally, pointer arguments should be hidden; but communication of names is needed for a process calculus