Mathematical Foundations of Programming Semantics

7th International Conference, Pittsburgh, PA, USA, March 25-28, 1991. Proceedings

AvStephen Brookes,Michael Main

Häftad, Engelska, 1992

Del i serien Lecture Notes in Computer Science

541 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This volume contains the proceedings of the SeventhInternational Conferenceon the Mathematical Foundations ofProgramming 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 andmathematicians for discussion of research problems, resultsand directions in programming language semantics and relatedareas. A major goalof the series is to improvecommunication and interaction between researchers in theseareas and to establish ties between related areas ofresearch.The volume contains revised and refereed versions of each ofthe contributed papers and refereed papers by three invitedspeakers:Jon Barwise, John Reynolds, and Mitchell Wand.

Produktinformation

Utgivningsdatum:1992-05-20
Mått:216 x 279 x 28 mm
Vikt:779 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:508
Upplaga:1992
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540555117

Utforska kategorier

Innehållsförteckning

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.