Comparative semantics for linear arrays of communicating processes [chapter]

J. W. Bakker, F. Breugel, A. Bruin
1993 Lecture Notes in Computer Science  
Operational (O) and denotational (D) semantic models are designed for a language incorporating a version of the UNIX fork and pipe commands. Taking a simple while language as starting point, a number of programming constructs are added which achieve that a program can generate a dynamically evolving linear a rray o f p rocesses connected by channels. Over these channels sequences of values ('streams') are transmitted. Both O and D are de ned as (unique) xed point of a contractive higher order
more » ... erator. This allows a smooth proof that O and D are equivalent. Additional features are the use of hiatons, and of the closely related syntactic resumptions and semantic continuations. Both operational (O) -based on an SOS style transition system ( Plo81]) -and denotational (D) semantics for L will be presented, and their equivalence will be established. Simple topological techniques will su ce for the mathematical underpinning of both models. In fact, Banach's xed point theorem ( Ban22]) is all we need. ( BR92] g i v es an overview of more advanced uses of topological modelling.) Forks and pipes occur in several papers on programming language design and application (forks, e.g., in HSS91], pipes in KK92]). Semantic studies focusing on these topics are scarce (e.g. AW85, Ben82, Bru86, MA89, RS83, RS92]), and none of them develops both operational and denotational models. Accordingly, w e see the comparative result as the main contribution of our paper. UNIX is a trademark of Bell Laboratories.
doi:10.1007/3-540-57182-5_17 fatcat:hce52khtpzb4la2hehpij44zm4