Mathematical Foundations of Programming Semantics
Editat de Stephen Brookes, Michael Main, Austin Melton, Michael Mislove, David Schmidten Limba Engleză Paperback – 20 mai 1992
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (2) | 333.41 lei 6-8 săpt. | |
| Springer – 20 mai 1992 | 333.41 lei 6-8 săpt. | |
| Springer – 20 mai 1994 | 642.53 lei 6-8 săpt. |
Preț: 333.41 lei
Preț vechi: 416.76 lei
-20%
Puncte Express: 500
Preț estimativ în valută:
58.96€ • 67.61$ • 50.95£
58.96€ • 67.61$ • 50.95£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540555117
ISBN-10: 3540555110
Pagini: 520
Ilustrații: VIII, 508 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.78 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540555110
Pagini: 520
Ilustrații: VIII, 508 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.78 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.