Abstract
Algebraic program is considered as a system of rewriting rules jointly with rewriting strategy that may be represented in procedural form. The optimization of an algebraic program therefore is reduced to the development of optimal strategy and optimal implementation of it. This paper is devoted to the problem of finding optimal strategies for the given set of rewriting rules. New algorithm which implement the strategy of call by need type is proposed for regular systems. This algorithm generalizes previously developed approaches based on strongly necessary occurrences (Huet and Levy) and strongly necessary sets (Sekar and Ramakrishnan). The possibility of extending call by need strategies to a more complex environment of rewriting provided by APS is discussed.
Preview
Unable to display preview. Download preview PDF.
References
V. Ambriola and A. Salibra. Tree sequential term rewriting system. TR-40/89, University of Pisa, 1989.
J. A. Bergstra, J. Hearing, and P. Klint, editors. Algebraic Specification. ACM Press and Addison-Wesley, 1989.
M. Bidoit and C. Choppy. ASSPEGIQUE: an integrated environment for algebraic specifications. In Proc. Intern. Joint Conf. on Theory and Practice of Software Development, pages 246–260. Springer-Verlag, 1985.
J. Goguen, C. Kirchner, H. Kirchner, A. Megrelis, and T. Wincler. An introduction to OBJ-3. In Jouannaud and Kaplan [6].
G. Huet and J. J. Levy. Computations in nonambiguous linear term rewriting systems. Technical Report 359, INRIA, Le Chesnay, France, 1979.
J.-P. Jouannaud and S. Kaplan, editors. Proc. 1st Intern. Workshope on Conditional Term Rewriting Systems. Springer-Verlag, 1988.
C. Kirchner and H. Kirchner. Reveur3: Implementation of a general completion procedure parametrized by built-in theories and strategies. Science of Computer Programming, 20(8):69–86, 1986.
J. W. Klop and A. Middeldorp. Strongly sequential term rewriting system. TR CS-R8730, Centre for Mathematics and Computer science, Amsterdam, 1988.
P. Lescanne, editor. Rewriting Techniques and Applications, volume 256 of LNCS. Springer-Verlag, 1987.
A. A. Letichevsky and J. V. Kapitonova. Algebraic programming in APS system. In Proc. of ISSAC '90, pages 68–75, Tokyo, Japan, August 20–24 1990. ACM, New York.
A. A. Letichevsky, J. V. Kapitonova, and S. V. Konozenko. Computations in APS. In Actes preliminaires, du symposium Franco-Sovietique Informatika 91, pages 133–153, Le Chesnay, France, 1991. INRIA.
A. A. Letichevsky, J. V. Kapitonova, and S. V. Konozenko. Optimization of algebraic programs. In Proc. of ISSAC '91, pages 370–376. ACM Press, 1991.
M. J. O'Donnell. Term rewriting implementation of equational logic programming. In Lescanne [9], pages 1–12.
R. C. Sekar and I. V. Ramakrishnan. Programming in equational logic: Beyond strong sequentiality. In Proc. 5th Annual IEEE Symp. on Logic in Computer Sci, pages 230–241. IEEE Comp. Soc. Press, June 1990.
D. Sherman, R. Strandh, and I. Durand. Optimization of equational programs using partial evaluation. In Proc. of the Symposium on partial evaluation and semantic-based program manipulation, Sigplan Notices, volume 26, pages 72–82. ACM Press, 1991.
A. A. Stogny and T. A. Grinchenko. Mir series computers and ways of increasing the level of machine intelligence. Cybernetics (Translated from Russian), 23(6):807–817, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Letichevsky, A.A. (1993). Development of rewriting strategies. In: Bruynooghe, M., Penjam, J. (eds) Progamming Language Implementation and Logic Programming. PLILP 1993. Lecture Notes in Computer Science, vol 714. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57186-8_92
Download citation
DOI: https://doi.org/10.1007/3-540-57186-8_92
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57186-5
Online ISBN: 978-3-540-47945-1
eBook Packages: Springer Book Archive