Blick ins Buch

Mathematical Foundations of Programming Semantics

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

Stephen Brookes, Michael Main, Austin Melton, Michael Mislove, David Schmidt (Herausgeber)

Buch | Softcover

VIII, 508 Seiten

1992
Springer Berlin (Verlag)
978-3-540-55511-7 (ISBN)

Lese- und Medienproben

Inhaltsverzeichnis (PDF)

Artikel merken

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.

Erscheint lt. Verlag	20.5.1992
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	VIII, 508 p.
Verlagsort	Berlin
Sprache	englisch
Maße	216 x 279 mm
Gewicht	777 g
Themenwelt	Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge
Schlagworte	algorithms • Calculus • Hardcover, Softcover / Informatik, EDV/Programmiersprachen • Lambda Calculus • Logic • Mathematical Foundations • Mathematical Logic • Mathematische Grundlagen • Mathematische Logik • Monoid • Programmier-Semantik • Programmiersprachen • Programming Languages • Programming Semantics • Sets • Theory of Computation • wissenschaftliches Rechnen
ISBN-10	3-540-55511-0 / 3540555110
ISBN-13	978-3-540-55511-7 / 9783540555117
Zustand	Neuware