+612 9045 4394
Mathematical Foundations of Programming Semantics : 7th International Conference, Pittsburgh, Pa, Usa, March 25-28, 1991. Proceedings - Stephen Brookes

Mathematical Foundations of Programming Semantics

7th International Conference, Pittsburgh, Pa, Usa, March 25-28, 1991. Proceedings

By: Stephen Brookes (Editor), Michael Main (Editor), Austin Melton (Editor), Michael Mislove (Editor), David Schmidt (Editor)

Paperback Published: 20th May 1992
ISBN: 9783540555117
Number Of Pages: 508

Share This Book:


or 4 easy payments of $36.74 with Learn more
Ships in 5 to 9 business days

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.

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.

ISBN: 9783540555117
ISBN-10: 3540555110
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 508
Published: 20th May 1992
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.67
Weight (kg): 0.73