Cantitate/Preț
Produs

Semantics: Foundations and Applications: REX Workshop, Beekbergen, The Netherlands, June 1-4, 1992. Proceedings: Lecture Notes in Computer Science, cartea 666

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

Din seria Lecture Notes in Computer Science

Preț: 65082 lei

Preț vechi: 81353 lei
-20% Nou

Puncte Express: 976

Preț estimativ în valută:
12455 12938$ 10346£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540565963
ISBN-10: 3540565965
Pagini: 676
Ilustrații: IX, 667 p.
Dimensiuni: 155 x 235 x 35 mm
Greutate: 0.93 kg
Ediția:1993
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

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.