D. [. Arbab and . Berry, Operational and denotational semantics of prolog, The Journal of Logic Programming, vol.4, issue.4, pp.309-329, 1987.
DOI : 10.1016/0743-1066(87)90008-2

]. A. App92, . P. Appelbar84-]-h, and . Barendregt, Compiling with Continuations The ?-calculus: its syntax and semantics, 1984.

M. [. Bossi, M. Bugliesi, and . Fabris, A new fixpoint semantics for prolog, Proc. of the 10th International Conference on Logic Programming, pp.374-389, 1993.

M. [. Barbuti, R. Codish, G. Giacobazzi, and . Levi, Modelling Prolog Control, Journal of Logic and Computation, vol.3, issue.6, pp.579-603, 1993.
DOI : 10.1093/logcom/3.6.579

O. [. Brisset and . Ridoux, Continuations in ?-Prolog, Proc. of the 10th International Conference on Logic Programming, pp.27-43, 1993.

]. J. De-bakker, Comparative semantics for flow of control in logic programming without logic, Information and Computation, vol.94, issue.2, 1988.
DOI : 10.1016/0890-5401(91)90036-2

]. A. De-bruin and E. P. De-vink, Continuation semantics for PROLOG with cut, Proc. TAPSOFT-89, pp.178-192, 1989.
DOI : 10.1007/3-540-50939-9_132

J. W. De-bakker, J. N. Kok, J. Ch, E. Meyer, J. Olderog et al., Contrasting themes in the semantics of imperative concurrency Equivalence of an operational and a denotational semantics for a Prolog-like language with cut, Current Trends in Concurrency: Overviews and Tutorials, pp.51-121, 1986.

A. [. Jones and . Mycroft, Stepwise development of operational and denotational semantics for Prolog, Proc. International Symposium on Logic Programming, 1984.

]. R. Kow74 and . Kowalski, Predicate logic as a programming language, proc. IFIP 74, pp.569-574, 1974.

]. R. Kow79 and . Kowalski, Algorithm= logic + control, Communications of the ACM, vol.22, issue.7, pp.424-436, 1979.

S. [. Mellish and . Hardy, Integrating Prolog in the POPLOG environment, 1984.

N. [. Nicholson and . Foo, A denotational semantics for Prolog, ACM Transactions on Programming Languages and Systems, vol.11, issue.4, pp.650-665, 1989.
DOI : 10.1145/69558.69564

D. [. Nadathur and . Miller, An overview of ?-prolog, Proc. Symp. Logic Programming, pp.810-827, 1988.

]. G. Plo75 and . Plotkin, Call by name, call by value and the ?-calculus, Theoretical Computer Science, vol.1, pp.125-159, 1975.

]. D. Sch86 and . Schmidt, Denotational semantics: a methodology for language development, 1986.

]. D. Sco76 and . Scott, Data types as lattices, SIAM Journal of Computing, vol.5, pp.522-587, 1976.

T. Sato and H. Tamaki, Existential continuation, New Generation Computing, vol.27, issue.No. 1, pp.421-438, 1989.
DOI : 10.1007/BF03037449

M. [. Tarau and . Boyer, Elementary logic programs, Proc. International Workshop on Programming languages implementation and Logic Programming -LNCS 456, 1990.
DOI : 10.1007/BFb0024183

]. K. Ued87 and . Ueda, Making exhaustive search programs deterministic: Part II, Proc. 4-th International Conference on Logic Programming, 1987.