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.
Cite
CITATION STYLE
de Bruin, A., & de Vink, E. P. (1989). Continuation semantics for PROLOG with cut. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 351 LNCS, pp. 178–192). Springer Verlag. https://doi.org/10.1007/3-540-50939-9_132
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
