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.
Author(s): QingMing Ma, John C. Reynolds (auth.), Stephen Brookes, Michael Main, Austin Melton, Michael Mislove, David Schmidt (eds.)
Series: Lecture Notes in Computer Science 598
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1992
Language: English
Pages: 508
Tags: Programming Languages, Compilers, Interpreters; Computation by Abstract Devices; Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Mathematical Logic and Foundations
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
