Fully abstract denotational semantics for flat Concurrent Prolog

R.T. Gerth, M. Codish, Y. Lichtenstein, E. Shapiro

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

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
Title of host publicationLogic in Computer Science (Proceedings Third Annual IEEE Symposium, LICS'88, Edinburgh, UK, July 5-8, 1988)
PublisherInstitute of Electrical and Electronics Engineers
Pages320-335
Number of pages16
ISBN (Print)0-8186-0853-6
DOIs
Publication statusPublished - 1988

Fingerprint Dive into the research topics of 'Fully abstract denotational semantics for flat Concurrent Prolog'. Together they form a unique fingerprint.

Cite this