Cantitate/Preț
Produs

Mathematical Foundations of Programming Semantics: 9th International Conference, New Orleans, LA, USA, April 7 - 10, 1993. Proceedings: Lecture Notes in Computer Science, cartea 802

Editat de Stephen Brookes, Michael Main, Austin Melton, Michael Mislove, David Schmidt
en Limba Engleză Paperback – 20 mai 1994
This volume is the proceedings of the Ninth International Conference on the Mathematical Foundations of Programming Semantics, held in New Orleans in April 1993. The focus of the conference series is the semantics of programming languages and the mathematics which supports the study of the semantics. The semantics is basically denotation. The mathematics may be classified as category theory, lattice theory, or logic. Recent conferences and workshops have increasingly emphasized applications of the semantics and mathematics. The study of the semantics develops with the mathematics and the mathematics is inspired by the applications in semantics. The volume presents current research in denotational semantics and applications of category theory, logic, and lattice theory to semantics.
Citește tot Restrânge

Toate formatele și edițiile

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

Din seria Lecture Notes in Computer Science

Preț: 65035 lei

Preț vechi: 81294 lei
-20% Nou

Puncte Express: 976

Preț estimativ în valută:
12446 12929$ 10339£

Carte tipărită la comandă

Livrare economică 01-15 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540580270
ISBN-10: 3540580271
Pagini: 664
Ilustrații: X, 654 p.
Dimensiuni: 155 x 233 x 35 mm
Greutate: 0.92 kg
Ediția:1994
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Final universes of processes.- On the symmetry of sequentiality.- Computational adequacy via ‘mixed’ inductive definitions.- A structural co-induction theorem.- Three metric domains of processes for bisimulation.- Topological models for higher order control flow.- An investigation into functions as processes.- Time abstracted bisimulation: Implicit specifications and decidability.- Timewise refinement for communicating processes.- Axiomatising real-timed processes.- A predicative semantics for the refinement of real-time systems.- Compositional process semantics of Petri Boxes.- On the specification of elementary reactive behaviour.- A chemical abstract machine for graph reduction extended abstract.- Lifting theorems for Kleisli categories.- Sequential functions on indexed domains and full abstraction for a sub-language of PCF.- Another approach to sequentiality: Kleene's unimonotone functions.- Mechanizing logical relations.- Some quasi-varieties of iteration theories.- Probabilistic power domains, information systems, and locales.- Linear domains and linear maps.- Universal quasi-prime algebraic domains.- Holomorphic models of exponential types in linear logic.- A syntax for linear logic.- A complete axiomatisation for trace congruence of finite state behaviors.- The asymmetric topology of computer science.- Ultimately periodic words of rational ?-languages.- Category of ?-functors.- A categorical interpretation of Landin's correspondence principle.- An operational semantics for TOOPLE: A statically-typed object-oriented programming language.- On the transformation between direct and continuation semantics.