This is the latest in a series of proceedings of conferences on the Mathematical Foundations of Programming Semantics. The purpose of the series is to bring together mathematicians and theoretical computer scientists who share the common interests of working on problems related to programming language semantics. The purpose of the book is to bring into print as quickly as possible papers which reflect the state of research on the topics comprising this area. The intended audience for the book consists of those researchers and graduate students with an interest in the research areas which are related to those presented in the book: programming language semantics, including algebraic, denotational and operational semantics, logics of programs, specification techniques, etc., and the relevant areas of mathematics research, including category theory, domain theory, ordered structures and lattice theory, and metric space methods. The papers included in the book represent the latest results in various facets of this rather broad research area, and this is the first time some of the ideas contained in these works are appearing in print.
Author(s): Samson Abramsky (auth.), M. Main, A. Melton, M. Mislove, D. Schmidt (eds.)
Series: Lecture Notes in Computer Science 442
Edition: 1
Publisher: Springer-Verlag New York
Year: 1990
Language: English
Pages: 444
Tags: Logics and Meanings of Programs; Algorithm Analysis and Problem Complexity; Programming Techniques
A generalized Kahn Principle for abstract asynchronous networks....Pages 1-21
Operations on records....Pages 22-52
Connections between a concrete and an abstract model of concurrent systems....Pages 53-79
A hierarchy of domains for real-time distributed computing....Pages 80-128
Factorizing proofs in timed CSP....Pages 129-159
Unbounded nondeterminism in CSP....Pages 160-193
The semantics of priority and fairness in occam....Pages 194-208
Inductively defined types in the Calculus of Constructions....Pages 209-228
On some semantic issues in the reflective tower....Pages 229-246
Semantic models for total correctness and fairness....Pages 247-270
Equationally fully abstract models of PCF....Pages 271-283
Generalization of final algebra semantics by relativization....Pages 284-300
Termination, deadlock and divergence....Pages 301-318
A category-theoretic semantics for unbounded indeterminacy....Pages 319-332
Algebraic types in PER models....Pages 333-350
Pseudo-retract functors for local lattices and bifinte L-domains....Pages 351-363
L-domains and lossless powerdomains....Pages 364-372
Does “N+1 times” prove more programs correct than “N times”?....Pages 373-389
An algebraic formulation for data refinement....Pages 390-401
Categorical semantics for programming languages....Pages 402-417
Initial algebra semantics for lambda calculi....Pages 418-439
