Continuation semantics for PROLOG with cut

We present a denotational continuation semantics for PROLOG with cut. First a uniform language B is studied, which captures the control flow aspects of PROLOG. The denotational semantics for B is proven equivalent to a transition system based operational semantics. The congruence proof relies on the representation of the operational semantics as a chain of approximations and on a convenient induction principle. Finally, we interpret the abstract language B such that we obtain equivalent denotational and operational models for PROLOG itself

Retractions in comparing PROLOG semantics

We present an operational model O and a continuation based denotational model D for a uniform variant of PROLOG, including the cut operator. The two semantical definitions make use of higher order transformations Phi and Psi, respectively. We prove O and D equivalent in a novel way by comparing yet another pair of higher order transformations Phi~ and Psi~, that yield Phi and Psi, respectively, by application of a suitable abstraction operator

On the asynchronous nature of communication in concurrent logic languages : a fully abstract model based on sequences

On the asynchronous nature of communication model based on sequences b