Mathematical Foundations of Programming Semantics: 7th International Conference, Pittsburgh, PA, USA, March 25-28, 1991. Proceedings - Tapa blanda

Sinopsis

Types, abstraction, and parametric polymorphism, part 2.- Call-by-value combinatory logic and the lambda-value calculus.- From operational to denotational semantics.- A simple language supporting angelic nondeterminism and parallel composition.- The equivalence of two semantic definitions for inheritance in object-oriented languages.- Primitive recursive functional with dependent types.- Typed homomorphic relations extended with subtypes.- Information links in domain theory.- Nonwellfounded sets and programming language semantics.- Simultaneous substitution in the typed lambda calculus.- HSP type theorems in the category of posets.- Decomposition of domains.- Cartesian closed categories of domains and the space proj(D).- An upper power domain construction in terms of strongly compact sets.- Correctness of procedure representations in higher-order assembly language.- An algorithm for analyzing communicating processes.- Continuous functions and parallel algorithms on concrete data structures.- Trade-offs in true concurrency: Pomsets and mazurkiewicz traces.- On relating concurrency and nondeterminism.- On continuous time agents.- A monoidal closed category of event structures.- An exper model for Quest.- Equations for if-then-else.- Program correctness and matricial iteration theories.- Liminf progress measures.- Connections.

"Sinopsis" puede pertenecer a otra edición de este libro.