Del 666 - Lecture Notes in Computer Science

Semantics: Foundations and Applications

REX Workshop, Beekbergen, The Netherlands, June 1-4, 1992. Proceedings

Häftad, Engelska, 1993

Av J.W.de Bakker, W.-P.de Roever, G. Rozenberg, J. W. De Bakker, W. -P De Roever, W. -P. de Roever

1 449 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum1993-04-29
Mått155 x 235 x 37 mm
Vikt1 007 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor667
Upplaga1993
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540565963

Tillhör följande kategorier

Programspråk inom Data och it
Databaser inom Data och it
Referensverk och tvärvetenskap inom Samhalle och politik
Programmeringsböcker inom Data och it
Programvaruutveckling inom Data och it
Systemvetenskap och AI inom Data och it

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.