Mathematical Foundations of Programming Semantics: 7th International Conference, Pittsburgh, PA, USA, March 25-28, 1991. Proceedings (Lecture Notes in Computer Science, 598)

This volume contains the proceedings of the Seventh International Conferenceon the Mathematical Foundations of Programming Semantics, held at Carnegie Mellon University, March 1991. The conference continued a series of annual meetings, alternating between workshop and conference formats, intended to bring together computer scientists and mathematicians for discussion of research problems, results and directions in programming language semantics and related areas. A major goalof the series is to improve communication and interaction between researchers in these areas and to establish ties between related areas of research. The volume contains revised and refereed versions of each of the contributed papers and refereed papers by three invited speakers:Jon Barwise, John Reynolds, and Mitchell Wand. Types, abstraction, and parametric polymorphism, part 2....Pages 1-40 Call-by-value combinatory logic and the lambda-value calculus....Pages 41-53 From operational to denotational semantics....Pages 54-76 A simple language supporting angelic nondeterminism and parallel composition....Pages 77-101 The equivalence of two semantic definitions for inheritance in object-oriented languages....Pages 102-124 Primitive recursive functional with dependent types....Pages 125-143 Typed homomorphic relations extended with subtypes....Pages 144-167 Information links in domain theory....Pages 168-192 Nonwellfounded sets and programming language semantics....Pages 193-206 Simultaneous substitution in the typed lambda calculus....Pages 207-220 HSP type theorems in the category of posets....Pages 221-234 Decomposition of domains....Pages 235-258 Cartesian closed categories of domains and the space proj(D)....Pages 259-271 An upper power domain construction in terms of strongly compact sets....Pages 272-293 Correctness of procedure representations in higher-order assembly language....Pages 294-311 An algorithm for analyzing communicating processes....Pages 312-325 Continuous functions and parallel algorithms on concrete data structures....Pages 326-349 Trade-offs in true concurrency: Pomsets and mazurkiewicz traces....Pages 350-375 On relating concurrency and nondeterminism....Pages 376-402 On continuous time agents....Pages 403-425 A monoidal closed category of event structures....Pages 426-435 An exper model for Quest....Pages 436-445 Equations for if-then-else....Pages 446-456 Program correctness and matricial iteration theories....Pages 457-476 Liminf progress measures....Pages 477-491 Connections....Pages 492-506 "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."--PUBLISHER'S WEBSITE. "This volume contains the proceedings of the Seventh International Conferenceon the Mathematical Foundations of Programming Semantics, held at Carnegie Mellon University, March 1991. The conference continued a series of annual meetings, alternating between workshop and conference formats, intended to bring together computer scientists and mathematicians for discussion of research problems, results and directions in programming language semantics and related areas. A major goalof the series is to improve communication and interaction between researchers in these areas and to establish ties between related areas of research. The volume contains revised and refereed versions of each of the contributed papers and refereed papers by three invited speakers:Jon Barwise, John Reynolds, and Mitchell Wand."--PUBLISHER'S WEBSITE.