Fully abstract denotational semantics for flat Concurrent Prolog

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

Research output: Contribution to conferencePaper

23 Citations (Scopus)

Abstract

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
Pages320-335
Number of pages16
DOIs
Publication statusPublished - Jul 1988
EventProceedings of the 3rd Annual Symposium on Logic in Computer Science (LICS) - July 1988
Duration: 1 Jul 1988 → …

Conference

ConferenceProceedings of the 3rd Annual Symposium on Logic in Computer Science (LICS)
CityJuly 1988
Period1/07/88 → …

Cite this