ShopSpell

Semantics: Foundations and Applications: REX Workshop, Beekbergen, The Netherlands, June 1-4, 1992. Proceedings [Paperback]

$79.99     $109.99   27% Off      (Free Shipping)
100 available
  • Category: Books (Computers)
  • ISBN-10:  3540565965
  • ISBN-10:  3540565965
  • ISBN-13:  9783540565963
  • ISBN-13:  9783540565963
  • Publisher:  Springer
  • Publisher:  Springer
  • Pages:  667
  • Pages:  667
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-Mar-1993
  • Pub Date:  01-Mar-1993
  • SKU:  3540565965-11-SPRI
  • SKU:  3540565965-11-SPRI
  • Item ID: 105295672
  • List Price: $109.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 5 business days
  • Delivery by: Oct 16 to Oct 18
  • Notes: Brand New Item. Not shipped to AK, HI, APO, FPO, AE.
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.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 unnestelC'
Add Review