Abstract: "One of the main aims of this paper is to show that the nature of the communication mechanism of concurrent logic languages is essentially different from the classical paradigms of CCS and TCSP. We define indeed a compositional semantics based on linear sequences, whilst more complica...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Boer, Frank S. de (VerfasserIn), Palamidessi, Catuscia (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Amsterdam 1990
Schriftenreihe:	Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS 90,46
Schlagworte:	Programming languages (Electronic computers) > Semantics
Online-Zugang:	kostenfrei
Zusammenfassung:	Abstract: "One of the main aims of this paper is to show that the nature of the communication mechanism of concurrent logic languages is essentially different from the classical paradigms of CCS and TCSP. We define indeed a compositional semantics based on linear sequences, whilst more complicated structures, like trees and failure sets, are needed to model compositionally CCS and TCSP. Moreover, we prove that this semantics is fully abstract, namely that the information encoded by these sequences is necessary. Our observation criterium consists of all the finite results, i.e. the computed constraint together with the termination mode (success, failure, or deadlock) The operations we consider are the parallel composition of goals and the union of neatly intersecting programs. We define a compositional operational model delivering sequences of input-output constraints, and we obtain a fully abstract denotational semantics by requiring additionally some closure conditions, that model the monotonic nature of communication in concurrent constraint languages.
Beschreibung:	24 S.