Abstract
This paper discusses the transformation of logic programs by using mode input-output. We consider a system based on the Unfold/Fold transformations. First we introduce a notion of well-moded clause and well-moded definite program. We prove that under certain conditions the application of the Unfold/Fold transformations preserves the notion of well-modedness. We also define a transformation of a definite program into term rewriting system and we establish the correctness of this transformation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F. Alexandre. Transformations de programmes logiques. Thèse de l’université de Nancy I, fevrier 1991.
K.R. Apt and M.H Van Emden. Contribution to the theory of logic programming. Journal of the Association for Computing Machinery, 29(3): 841–862, 1982.
R.S. Bird. The promotion and accumulation strategies in transformational programming. ACM TOPLAS, 6(4): 487–504, 1984.
R.M Burstall and J.A Darlington. Transformation system for developing recursive programs. Journal of the Association for Computing Machinery, 24(1): 44–67, 1977.
S.K. Debray and D.S. Warren. Detection and optimization of functional computations in prolog. In E. Shapiro, editor, Proceedings of the Third International Conference on Logic Programming, London, volume 225 of Lecture Notes in Computer Science, pages 490-504. Springer-Verlag, 1986.
S.K. Debray and D.S. Warren. Automatic mode inference for logic programs. Journal of Logic Programming, 5: 207–229, 1988.
N. Dershowitz and J. P. Jouannaud. Rewriting systems. Handbook of Computer Science. North Holland, 1989. To be published.
M.S. Feather. A survey and classification of some program transformation techniques. In Proc. TC2 IFIP Working Conference on Program Specification and Transformation, Bad-Tolz, F.R.G, 1986.
Projet Formel. The CAML Reference Manual Version 2.6. Inria, March 1989.
J.W. Lloyd. Foundations of Logic Programming. Springer Verlag, 1988.
C. S. Mellish. Some global optimizations for a prolog compiler. Journal of Logic Programming, 1: 43–66, 1985.
A. Pettorossi and M. Proietti. The automatic construction of logic programs. In IFIP WG2.1 Meeting, January 1989. Preliminary Version.
A. Pettorossi and M. Proietti. Decidability results and characterization of strategies for the development of logic programs. In G. Levi and M. Martelli, editors, 6th International Conference on Logic Programming, Lisbon (Portugal), 1989. MIT Press.
U. S. Reddy. Transformation of logic programs into functional programs. In International Symposium on Logic Programming, Atlantic City, pages 187-196, 1984.
H. Tamaki and T. Sato. Unfold/fold transformation of logic programs. In Proceedings of the 2nd International Logic Programming Conference, Uppsala, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag London
About this paper
Cite this paper
Alexandre, F., Bsaies, K., Quéré, A. (1992). On Using Mode Input-output for Transforming Logic Programs. In: Clement, T.P., Lau, KK. (eds) Logic Program Synthesis and Transformation. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3494-7_11
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3494-7_11
Publisher Name: Springer, London
Print ISBN: 978-3-540-19742-3
Online ISBN: 978-1-4471-3494-7
eBook Packages: Springer Book Archive