Mathematical Foundations of Programming Semantics -

Mathematical Foundations of Programming Semantics

5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29-April 1, 1989. Proceedings
Buch | Softcover
444 Seiten
1990
Springer-Verlag New York Inc.
978-0-387-97375-3 (ISBN)
53,49 inkl. MwSt
This is the latest in a series of proceedings of conferences on the Mathematical Foundations of Programming Semantics. The purpose of the series is to bring together mathematicians and theoretical computer scientists who share the common interests of working on problems related to programming language semantics. The purpose of the book is to bring into print as quickly as possible papers which reflect the state of research on the topics comprising this area. The intended audience for the book consists of those researchers and graduate students with an interest in the research areas which are related to those presented in the book: programming language semantics, including algebraic, denotational and operational semantics, logics of programs, specification techniques, etc., and the relevant areas of mathematics research, including category theory, domain theory, ordered structures and lattice theory, and metric space methods. The papers included in the book represent the latest results in various facets of this rather broad research area, and this is the first time some of the ideas contained in these works are appearing in print.

A generalized Kahn Principle for abstract asynchronous networks.- Operations on records.- Connections between a concrete and an abstract model of concurrent systems.- A hierarchy of domains for real-time distributed computing.- Factorizing proofs in timed CSP.- Unbounded nondeterminism in CSP.- The semantics of priority and fairness in occam.- Inductively defined types in the Calculus of Constructions.- On some semantic issues in the reflective tower.- Semantic models for total correctness and fairness.- Equationally fully abstract models of PCF.- Generalization of final algebra semantics by relativization.- Termination, deadlock and divergence.- A category-theoretic semantics for unbounded indeterminacy.- Algebraic types in PER models.- Pseudo-retract functors for local lattices and bifinte L-domains.- L-domains and lossless powerdomains.- Does “N+1 times” prove more programs correct than “N times”?.- An algebraic formulation for data refinement.- Categorical semantics for programming languages.- Initial algebra semantics for lambda calculi.

Erscheint lt. Verlag 10.8.1990
Reihe/Serie Lecture Notes in Computer Science ; 442
Zusatzinfo VIII, 444 p.
Verlagsort New York, NY
Sprache englisch
Maße 170 x 242 mm
Themenwelt Mathematik / Informatik Informatik Programmiersprachen / -werkzeuge
Informatik Theorie / Studium Algorithmen
Mathematik / Informatik Mathematik Angewandte Mathematik
Wirtschaft Betriebswirtschaft / Management Wirtschaftsinformatik
ISBN-10 0-387-97375-3 / 0387973753
ISBN-13 978-0-387-97375-3 / 9780387973753
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media

von Jens Gallenbacher

Buch | Softcover (2021)
Springer (Verlag)
29,99
Interlingua zur Gewährleistung semantischer Interoperabilität in der …

von Josef Ingenerf; Cora Drenkhahn

Buch | Softcover (2023)
Springer Fachmedien (Verlag)
32,99