UID:
edoccha_9959186205902883
Umfang:
1 online resource (IX, 667 p.)
Ausgabe:
1st ed. 1993.
Ausgabe:
Online edition Springer Lecture Notes Archive ; 041142-5
ISBN:
3-540-47595-8
Serie:
Lecture Notes in Computer Science, 666
Inhalt:
Researchers working on the semantics of programming languages came together in The Netherlands in June 1992 for a workshop on Semantics - Foundations and Applications. This volume is based on the meeting and contains material prepared by the lecturers after the meeting took place. The volume includes papers on a wide range of topics in both foundationsand applications, including: - Comparative domain theory, category theory, information systems, - Concurrency: process algebras, asynchronous communication, action semantics, trace nets, process refinement, concurrent constraint programming, - Predicate transformers, refinement,weakest preconditions, - Comparative semantics of programming concepts, full abstraction, - Reasoning about programs: total correctness, epistemic logic, - Logic programming, - Functional programming: sequentiality, integration with concurrency, applied structured operational semantics. The workshop was an activity of the project REX (Research andEducation in Concurrent Systems) sponsored by the Netherlands NFI (NationaleFaciliteit Informatica) Programme.
Anmerkung:
Bibliographic Level Mode of Issuance: Monograph
,
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.
,
English
In:
Springer eBooks
Weitere Ausg.:
ISBN 3-540-56596-5
Sprache:
Englisch
DOI:
10.1007/3-540-56596-5
URL:
http://dx.doi.org/10.1007/3-540-56596-5
Bookmarklink