Abstract
In this paper, a static analysis of Prolog programs has been proposed to improve the efficiency by replacing run-time unification with matching. Programs for which run-time unification can be replaced by matching are called unification-free programs. We propose a set of sufficient conditions for unification-freedom improving the existing results and discuss the application of our results in improving WAM code of Prolog programs. Permutation and PRESS (a system developed at Edinburgh for solving symbolic equations) and programs flatten-dl, quick-sort-dl using difference-lists are example programs which can be handled by our results but not by the earlier results.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H. Ait-Kaci (1990), The WAM: a (real) tutorial, Tech. Rep., DIGITAL, Paris.
K.R. Apt and S. Etalle (1993), On the unification free Prolog programs, Proc. MFCS'93, Lect. Notes in Comp. Sci., 711, pp. 1–19, Springer-Verlag.
K.R. Apt and A. Pellegrini (1992), Why the occur-check is not a problem, Proc. of PLILP'92, Lect. Notes in Comp. Sci., 631, pp. 69–86, Springer-Verlag.
I. Attali and P. Franchi-Zannettacci (1988), Unification-free execution of TYPOL programs by semantic attribute evaluation, Proc. Joint Intl. Conf. and Symp. on Logic Prog., JICSLP'88, pp. 160–177, MIT Press.
F.Bronsard, T.K. Lakshman and U.S. Reddy (1992), A framework of directionality for proving termination of logic programs, Proc. Joint Intl. Conf. and Symp. on Logic Prog., JICSLP'92, pp. 321–335, MIT Press.
P. Deransart and J. Maluszinski (1985), Relating Logic Programs and Attribute Grammars, Journal of Logic Programming 2, pp. 119–155.
S. Etalle (1994), More (on) unification-free Prolog programs, manuscript, CWI Amsterdam, September.
M.R.K. Krishna Rao and R.K. Shyamasundar (1994), Unification-free execution of well-moded and well-typed Prolog programs, Technical Report, TIFR Bombay, April. Revised in June 1995.
J. W. Lloyd (1987), Foundations of Logic Programming, Springer-Verlag.
M. Marchiori (1994), Localization of unification freedom through matching directions, Proc. Intl. Logic Prog. Symp., ILPS'94, MIT Press.
J. Maluszinski and H.J. Komorowski (1985), Unification-free execution of Prolog programs, Proc. IEEE Symp. on Logic Programming, pp. 78–86.
L. Sterling and M. Codish (1987), PRESSing for parallelism: a Prolog program made concurrent, in E. Shapiro (ed.), Concurrent Prolog: collected papers, Vol. 2, pp. 304–349, MIT press.
L. Sterling and E. Shapiro (1986), Art of Prolog, MIT Press.
D.H.D. Warren (1983), An abstract Prolog instruction set, Tech. Rep., SRI International.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rao, M.R.K.K., Shyamasundar, R.K. (1995). Unification-free execution of well-moded and well-typed Prolog programs. In: Mycroft, A. (eds) Static Analysis. SAS 1995. Lecture Notes in Computer Science, vol 983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60360-3_43
Download citation
DOI: https://doi.org/10.1007/3-540-60360-3_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60360-3
Online ISBN: 978-3-540-45050-4
eBook Packages: Springer Book Archive