Volume 351 of the series Lecture Notes in Computer Science pp 178-192


Continuation semantics for PROLOG with cut

  • A. de BruinAffiliated withFaculty of Economics, Erasmus University
  • , E. P. de VinkAffiliated withDepartment of Mathematics and Computer Science, Free University


We present a denotational continuation semantics for PROLOG with cut. First a uniform language ℬ is studied, which captures the control flow aspects of PROLOG. The denotational semantics for ℬ 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 ℬ such that we obtain equivalent denotational and operational models for PROLOG itself.