Skip to main content
SpringerLink
Log in

Development of rewriting strategies

  • Conference paper
  • First Online:
Progamming Language Implementation and Logic Programming (PLILP 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 714))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Ambriola and A. Salibra. Tree sequential term rewriting system. TR-40/89, University of Pisa, 1989.

    Google Scholar 

  2. J. A. Bergstra, J. Hearing, and P. Klint, editors. Algebraic Specification. ACM Press and Addison-Wesley, 1989.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. J. Goguen, C. Kirchner, H. Kirchner, A. Megrelis, and T. Wincler. An introduction to OBJ-3. In Jouannaud and Kaplan [6].

    Google Scholar 

  5. G. Huet and J. J. Levy. Computations in nonambiguous linear term rewriting systems. Technical Report 359, INRIA, Le Chesnay, France, 1979.

    Google Scholar 

  6. J.-P. Jouannaud and S. Kaplan, editors. Proc. 1st Intern. Workshope on Conditional Term Rewriting Systems. Springer-Verlag, 1988.

    Google Scholar 

  7. 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.

    Google Scholar 

  8. J. W. Klop and A. Middeldorp. Strongly sequential term rewriting system. TR CS-R8730, Centre for Mathematics and Computer science, Amsterdam, 1988.

    Google Scholar 

  9. P. Lescanne, editor. Rewriting Techniques and Applications, volume 256 of LNCS. Springer-Verlag, 1987.

    Google Scholar 

  10. 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.

    Google Scholar 

  11. 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.

    Google Scholar 

  12. 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.

    Google Scholar 

  13. M. J. O'Donnell. Term rewriting implementation of equational logic programming. In Lescanne [9], pages 1–12.

    Google Scholar 

  14. 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.

    Google Scholar 

  15. 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.

    Google Scholar 

  16. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Glushkov Institute of Cybernetics, Ukrainian Acad. of Sciences, 252207, Kiev, Ukraine

    A. A. Letichevsky

Authors
  1. A. A. Letichevsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Maurice Bruynooghe Jaan Penjam

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation