Mathematical Foundations of Programming Semantics
Springer-Verlag New York Inc.
978-0-387-97375-3 (ISBN)
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? |
aus dem Bereich