Concurrency in Programming and Database Systems

Overview

Concurrency in Programming and Database Systems is not based on any particular computer language; rather, it discusses each theoretical concept in terms of a "pure" language construct that embodies that concept and then shows how to formally and informally reason about constructs. The texts discusses Modula-2 as an example of coroutines, Occam as an example of synchronous message passing, Ada as an example of rendezvous, Argus as an example of nested transactions, and Linda as an example of an interesting combination of paradigms. The author's goals are to show the compromises, extensions, and trade-offs that language designers feel obliged to make in order to embody a concept into a practical language.