Cantitate/Preț
Produs

Mathematical Foundations of Programming Semantics: 7th International Conference, Pittsburgh, PA, USA, March 25-28, 1991. Proceedings: Lecture Notes in Computer Science, cartea 598

Editat de Stephen Brookes, Michael Main, Austin Melton, Michael Mislove, David Schmidt
en Limba Engleză Paperback – 20 mai 1992
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 33054 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 20 mai 1992 33054 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 20 mai 1994 63814 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 33054 lei

Preț vechi: 41316 lei
-20% Nou

Puncte Express: 496

Preț estimativ în valută:
5848 6875$ 5122£

Carte tipărită la comandă

Livrare economică 29 ianuarie-12 februarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540555117
ISBN-10: 3540555110
Pagini: 520
Ilustrații: VIII, 508 p.
Dimensiuni: 216 x 279 x 27 mm
Greutate: 0.73 kg
Ediția:1992
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.