Fully abstract denotational semantics for flat Concurrent Prolog

R. Gerth, M. Codish, Yossi Lichtenstein, E. Shapiro

Research output: Contribution to conferencePaperpeer-review

24 Citations (Scopus)


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.
Original languageEnglish
Number of pages16
Publication statusPublished - Jul 1988
Event3rd Annual Symposium on Logic in Computer Science (LICS) - Edinburgh, United Kingdom
Duration: 5 Jul 19888 Jul 1988


Conference3rd Annual Symposium on Logic in Computer Science (LICS)
Country/TerritoryUnited Kingdom

Cite this