textabstractWe 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
Delimited continuations are a famous control primitive that originates in the functional programming...
An implementation of a delimited continuations, known in the functional programming world, is shown ...
A denotational, hence, compositional semantics for a subset of Concurrent Prolog is developed and re...
AbstractAn abstract language B embodying the flow of control component of PROLOG including the cut o...
AbstractThe semantics of PROLOG programs is usually given in terms of the model theory of first-orde...
AbstractIn this paper we propose an operational and a denotational semantics for Prolog. We deal wit...
textabstractWe present an operational model O and a continuation based denotational model D for a un...
In this paper we propose an operational and a denotational semantics for Prolog. We deal with the co...
International audienceExisting logic languages provide some simple " extra-logical " constructs for ...
Starting from a continuation-based interpreter for a simple logic programming language, propositiona...
Delimited continuations are a famous control primitive that originates in the functional programming...
[[abstract]]A continuation represents the dynamic effect of the remainder of a program. We present a...
[[abstract]]A continuation represents the dynamic effect of the remainder of a program. We present a...
AbstractA Vienna Definition Language operational semantics of PROLOG, which includes the cut, the da...
Delimited continuations are a famous control primitive that originates in the functional programming...
Delimited continuations are a famous control primitive that originates in the functional programming...
An implementation of a delimited continuations, known in the functional programming world, is shown ...
A denotational, hence, compositional semantics for a subset of Concurrent Prolog is developed and re...
AbstractAn abstract language B embodying the flow of control component of PROLOG including the cut o...
AbstractThe semantics of PROLOG programs is usually given in terms of the model theory of first-orde...
AbstractIn this paper we propose an operational and a denotational semantics for Prolog. We deal wit...
textabstractWe present an operational model O and a continuation based denotational model D for a un...
In this paper we propose an operational and a denotational semantics for Prolog. We deal with the co...
International audienceExisting logic languages provide some simple " extra-logical " constructs for ...
Starting from a continuation-based interpreter for a simple logic programming language, propositiona...
Delimited continuations are a famous control primitive that originates in the functional programming...
[[abstract]]A continuation represents the dynamic effect of the remainder of a program. We present a...
[[abstract]]A continuation represents the dynamic effect of the remainder of a program. We present a...
AbstractA Vienna Definition Language operational semantics of PROLOG, which includes the cut, the da...
Delimited continuations are a famous control primitive that originates in the functional programming...
Delimited continuations are a famous control primitive that originates in the functional programming...
An implementation of a delimited continuations, known in the functional programming world, is shown ...
A denotational, hence, compositional semantics for a subset of Concurrent Prolog is developed and re...