Cantitate/Preț
Produs

Semantics: Foundations and Applications

Editat de J. W. De Bakker, W. -P De Roever, G. Rozenberg
en Limba Engleză Paperback – 29 apr 1993
Researchers working on the semantics of programminglanguages came together in The Netherlands in June 1992 fora workshop on Semantics - Foundations and Applications. Thisvolume is based on the meeting and contains materialprepared by the lecturers after the meeting took place. Thevolume includes papers on a wide range of topics in bothfoundationsand applications, including:- Comparative domain theory, category theory, informationsystems,- Concurrency: process algebras, asynchronous communication,action semantics, trace nets, process refinement, concurrentconstraint programming,- Predicate transformers, refinement,weakest preconditions,- Comparative semantics of programming concepts, fullabstraction,- Reasoning about programs: total correctness, epistemiclogic,- Logic programming,- Functional programming: sequentiality, integration withconcurrency, applied structured operational semantics.The workshop was an activity of the project REX (ResearchandEducation in Concurrent Systems) sponsored by theNetherlands NFI (NationaleFaciliteit Informatica)Programme.
Citește tot Restrânge

Preț: 64313 lei

Preț vechi: 80392 lei
-20%

Puncte Express: 965

Preț estimativ în valută:
11364 13172$ 9910£

Carte tipărită la comandă

Livrare economică 15-29 mai


Specificații

ISBN-13: 9783540565963
ISBN-10: 3540565965
Pagini: 676
Ilustrații: IX, 667 p.
Dimensiuni: 155 x 235 x 37 mm
Greutate: 1.01 kg
Ediția:1993
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Predicate transformers and higher order logic.- Trace Nets.- Proving total correctness of programs in weak second-order logic.- On blocks: locality and asynchronous communication.- Semantics, orderings and recursion in the weakest precondition calculus.- A categorical model for logic programs: Indexed monoidal categories.- A categorical view of process refinement.- Compact metric information systems.- Asynchronous rendez-vous in distributed logic programming.- New semantic tools for logic programming.- Temporal preconditions of recursive procedures.- Towards an epistemic approach to reasoning about concurrent programs.- A fully abstract model for a nonuniform concurrent language with parameterization and locality.- SPCF: its model, calculus, and computational power.- Infinite behaviour and fairness in concurrent constraint programming.- Full abstraction and unnested recursion.- On the action semantics of concurrent programming languages.- Layered predicates.- A hyperdoctrinal view of concurrent constraint programming.- On the foundations of final semantics: Non-standard sets, metric spaces, partial orders.- Infinite systems of equations over inverse limits and infinite synchronous concurrent algorithms.- Some issues in the semantics of facile distributed programming.- On the relation between unity properties and sequences of states.- Expressiveness results for process algebras.- Compiling joy into Silicon: An exercise in applied structural operational semantics.