Continuation semantics for PROLOG with cut

  • A. de Bruin
  • E. P. de Vink
Communications

DOI: 10.1007/3-540-50939-9_132

Part of the Lecture Notes in Computer Science book series (LNCS, volume 351)
Cite this paper as:
de Bruin A., de Vink E.P. (1989) Continuation semantics for PROLOG with cut. In: Díaz J., Orejas F. (eds) TAPSOFT '89. CAAP 1989. Lecture Notes in Computer Science, vol 351. Springer, Berlin, Heidelberg

Abstract

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.

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • A. de Bruin
    • 1
  • E. P. de Vink
    • 2
  1. 1.Faculty of EconomicsErasmus UniversityRotterdamthe Netherlands
  2. 2.Department of Mathematics and Computer ScienceFree UniversityAmsterdamthe Netherlands

Personalised recommendations