A denotational, hence, compositional semantics for a subset of Concurrent Prolog is developed and related to an operational semantics. The denotational semantics makes divergence and the resultant substitutions of finite computations together with the termination mode-success, failure, or deadlock-observable. Relative to this notion of observation it is proved that the denotational semantics is fully abstract in the sense that it records the minimal amount of extra information beyond the observables to make it compositional. Full abstraction is an important property because it quantifies the information that one needs in order to reason about individual program-parts independently. This is believed to be the first such result in the area of concurrent logic programming.
|Title of host publication||Logic in Computer Science (Proceedings Third Annual IEEE Symposium, LICS'88, Edinburgh, UK, July 5-8, 1988)|
|Publisher||Institute of Electrical and Electronics Engineers|
|Number of pages||16|
|Publication status||Published - 1988|