Control Flow Semantics

by Bakker, J. W. De; Vink, Erik De

• ISBN13: 9780262041546
• ISBN10: 0262041545
• Format: Hardcover
• Copyright: 1996-04-01
• Publisher: Mit Pr

Summary

Control Flow Semantics presents a unified, formal treatment of the semantics of a wide spectrum of control flow notions as found in sequential, concurrent, logic, object-oriented, and functional programming languages. Whereas in more traditional approaches one focuses on input/output behavior, in this work equal attention is devoted to finite and infinite computations, the latter motivated by the growing importance of reactive systems. Knowledge of the comparative semantics of control structures is critical for the designers of programming languages, and it is difficult to choose from today's bewildering variety of control flow concepts (the ways in which a program specifies the successive steps to be taken during execution). Encyclopedic in scope, Control Flow Semantics provides comprehensive coverage of these concepts, developing operational and denotational models for control flow in 27 languages. In all cases, precise statements are given relating these models. A rich body of semantic definitional techniques is presented, including (labeled) transition systems, higher-order definitions, resumptions and continuations, linear or sequence-based models, and models specified by domain equations. Moreover, both symbol-based or schematic languages -- prevalent in the study of concurrency -- and state-based or interpreted languages are considered. The book is founded on a unifying mathematical basis of metric structures, allowing the full modeling of infinite behavior, as well as the exploitation of some classical results, such as Banach's fixed point theorem. Perspectives on further topics, such as full abstractness, noninterleaving semantics for parallelism, and second-order programming are also included. Foundations of Computing series

Author Biography

Erik de Vink is Assistant Professor of Computer Science, Vrije Universiteit, Amsterdam.

Table of Contents

Series Foreword
Preface
The 27 Languages
Introduction	p. 1
Recursion and Iteration	p. 15
Nondeterminacy	p. 83
Variations	p. 121
Uniform Parallelism	p. 149
Unbounded Nondeterminism	p. 177
Locality	p. 195
Nonuniform Parallelism	p. 231
Recursion Revisited	p. 263
Nested Resumptions	p. 285
Domain Equations and Bisimulation	p. 315
Branching Domains at Work	p. 345
Extensions of Nonuniform Parallelism	p. 369
Concurrent Object-oriented Programming	p. 393
Atomization, Commit, and Action Refinement	p. 415
The Control Flow Kernel of Logic Programming	p. 443
True Concurrency	p. 473
Full Abstractness	p. 491
Second-order Assignment	p. 509
A Proofs of Topological Theorems	p. 519
B Direct Operational Semantics	p. 527
C Domain Equations	p. 531
D Further Reading	p. 539
Bibliography	p. 543
Author Index	p. 557
Subject Index	p. 561
Table of Contents provided by Blackwell. All Rights Reserved.