Fully abstract denotational semantics for flat Concurrent Prolog

Gerth, R., Codish, M., Lichtenstein, Yossi and Shapiro, E. (1988) Fully abstract denotational semantics for flat Concurrent Prolog. In: 3rd Annual Symposium on Logic in Computer Science (LICS), 1988-07-05 - 1988-07-08.

Full text not available from this repository.

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.

Item Type:	Conference or Workshop Item (Paper)
Faculty \ School:	Faculty of Social Sciences > Norwich Business School
UEA Research Groups:	Faculty of Social Sciences > Research Groups > Innovation, Technology and Operations Management
Depositing User:	Elle Green
Date Deposited:	06 Jul 2012 10:35
Last Modified:	15 Dec 2022 01:09
URI:	https://ueaeprints.uea.ac.uk/id/eprint/39102
DOI:	10.1109/LICS.1988.5130

Actions (login required)

View Item