Abstract
This paper introduces a notion of existential continuation and provides a theoretical basis for continuation passing style (CPS) programming in logic programming. We present an algorithm, called CPS conversion, which converts a definite clause program into a CPS program, correspondingly to a predicate partition, an analogue of mode pattern specifying input and output for each predicate. Depending on the choice of a predicate partition, the resulting program can have various execution modes from bottom-up to top-down computations. We then give a proof, on the basis of a meaning preserving logic program transformation system, that the CPS conversion preserves the meaning of programs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Burstall, R. M. and Darlington, J., “A Transformation system for developing recursive programs,”JACM, Vol. 24, 1977.
Stoy, J. E.,Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, The MIT Press, 1977.
Jaffiar, J., Lassez. J-L. and Maher, M. J., “Some Issues and Trends in the Semantics of Logic Programming,”3rd International Logic Programming Conf., London, UK, 1986.
Sato, T. and Tamaki, H., “Deterministic Transformation and Deterministic Synthesis,”FGCS 1984, Tokyo, 1984.
Sato, T. and Tamaki, H., “Deterministic Transformation and Deterministic Synthesis,”France-Japan Artificial Intelligence and Computer Science Symposium 87, Cannes, 1987.
Sussman, G. J. and Steele Jr., G. L. “Scheme: An Interpreter for Extended Lambda Calculus,”AI meno 349, MIT, 1975.
Tamaki, H. and Sato, T., “Unfold/Fold Transformation of Logic Programs,”2nd International Logic Programming Conf., Uppsala, 1984.
Tamaki, H. and Sato, H., “A Gemeralized Correctness Proof of The Unfold/Fold Logic Program Transformation,”Technical Report, No. 86-4, Dept. of Info. Sci., Ibaraki Univ., 1986.
Ueda, K., “Making Exhaustive Search Deterministic,”3rd International Logic Programming Conf., London, UK, 1986.
Ueda, K., “Making Exhaustive Search Programs Deterministic: Part II,”4th International Conf. on Logic Programming, Melborne, 1987.
Wand, M., “Continuation-Based Program Transformation Strategies,”JACM, Vol. 27, No. 1, pp. 164–180, 1980.
Author information
Authors and Affiliations
About this article
Cite this article
Sato, T., Tamaki, H. Existential continuation. New Gener Comput 6, 421–438 (1989). https://doi.org/10.1007/BF03037449
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF03037449