Skip to main content
SpringerLink
Log in

Improving On-Demand Strategy Annotations

  • Conference paper
  • First Online:
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2514))

Abstract

In functional languages such as OBJ*, CafeOBJ, and Maude, symbols are given strategy annotations which specify (the order in) which subterms are evaluated. Syntactically, they are given either as lists of natural numbers or as lists of integers associated to function symbols whose (absolute) values refer to the arguments of the corresponding symbol. A positive index enables the evaluation of an argument whereas a negative index means “evaluate on-demand”. While strategy annotations containing only natural numbers have been implemented and received some recent investigation endeavor (regarding, e.g., termination and completeness), fully general annotations (also called on-demand strategy annotations), which have been proposed to support laziness in OBJ-like languages, are disappointingly under-explored to date. In this paper, we first point out a number of problems of current proposals for handling on-demand strategy annotations. Then, we propose a solution to these problems which is based on a suitable extension of the E-evaluation strategy of OBJ-like languages (that only considers annotations given as natural numbers) to on-demand strategy annotations. Our strategy incorporates a better treatment of demandness and also exhibits good computational properties; in particular, we show how to use it for computing (head-)normal forms. We also introduce a transformation for proving termination of the new evaluation strategy by using standard techniques.

Work partially supported by CICYT TIC2001-2705-C03-01, Acciones Integradas HI2000-0161, HA2001-0059, HU2001-0019, and Generalitat Valenciana GV01-424.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Alpuente, S. Escobar, and S. Lucas. Correct and complete (positive) strategy annotations for OBJ. Electronic Notes in Theoretical Computer Science, volume 71. Elsevier Sciences, to appear 2002.

    Google Scholar 

  2. M. Alpuente, M. Falaschi, P. Julián, and G. Vidal. Specialization of Lazy Functional Logic Programs. Sigplan Notices, 32(12):151–162, ACM Press, New York, 1997.

    Google Scholar 

  3. S. Antoy and S. Lucas. Demandness in rewriting and narrowing. Electronic Notes in Theoretical Computer Science, volume 76. Elsevier Sciences, to appear 2002.

    Google Scholar 

  4. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.

    Google Scholar 

  5. M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. Electronic Notes in Theoretical Computer Science, volume 4. Elsevier Sciences, 1996.

    Google Scholar 

  6. S. Eker. Term rewriting with operator evaluation strategies. Electronic Notes in Theoretical Computer Science, volume 15. Elsevier Sciences, 1998.

    Google Scholar 

  7. K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Proc. of the 12th Annual ACM Symposium on Principles of Programming Languages, POPL’85, pages 52–66. ACM Press, 1985.

    Google Scholar 

  8. W. Fokkink, J. Kamperman, and P. Walters. Lazy rewriting on eager machinery. ACM Transactions on Programming Languages and Systems, 22(1):45–86, 2000.

    Article  Google Scholar 

  9. K. Futatsugi and A. Nakagawa. An overview of Cafe specification environment-an algebraic approach for creating, verifying, and maintaining formal specification over networks-. In Proc. of 1st International Conference on Formal Engineering Methods, 1997.

    Google Scholar 

  10. B. Gramlich and S. Lucas. Modular termination of context-sensitive rewriting. In C. Kirchner, editor, Proc. of 4th International ACM SIG-PLAN Conference on Principles and Practice of Declarative Programming, PPDP’02, Pittsburg, USA, 2002. ACM Press, New York. To appear, 2002.

    Google Scholar 

  11. Jürgen Giesl and Aart Middeldorp. Transformation techniques for context-sensitive rewrite systems. Aachener Informatik-Berichte (AIBs) 2002-02, RWTH Aachen, 2002.

    Google Scholar 

  12. J. A. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, and J.P. Jouannaud. Introducing OBJ. In Joseph A. Goguen and Grant Malcolm, editors, Software Engineering with OBJ: algebraic specification in action. Kluwer, 2000.

    Google Scholar 

  13. S. Lucas. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming, 1998:1–61, 1998.

    MathSciNet  Google Scholar 

  14. S. Lucas. Termination of on-demand rewriting and termination of OBJ programs. In Harald Sondergaard, editor, Proc. 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP’01), pages 82–93, Firenze, Italy, September 2001. ACM Press, New York.

    Chapter  Google Scholar 

  15. S. Lucas. Context-sensitive rewriting strategies. Information and Computation, to appear, 2002.

    Google Scholar 

  16. S. Lucas. Lazy rewriting and context-sensitive rewriting. Electronic Notes in Theoretical Computer Science, volume 64. Elsevier Sciences, to appear, 2002.

    Google Scholar 

  17. S. Lucas. Termination of (canonical) context-sensitive rewriting. In Sophie Tison, editor, Proc. 13th International Conference on Rewriting Techniques and Applications, RTA’02, LNCS 2378:296–310, Springer-Verlag, Berlin, 2002.

    Google Scholar 

  18. J.J. Moreno-Navarro and M. Rodríguez-Artalejo. Logic Programming with Functions and Predicates: the Language BABEL. Journal of Logic Programming, 12(3):191–223, 1992.

    Article  MATH  Google Scholar 

  19. T. Nagaya. Reduction Strategies for Term Rewriting Systems, PhD Thesis. School of Information Science, Japan Advanced Institute of Science and Technology, 1999.

    Google Scholar 

  20. M. Nakamura and K. Ogata. The evaluation strategy for head normal form with and without on-demand flags. Electronic Notes in Theoretical Computer Science, volume 36. Elsevier Sciences, 2001.

    Google Scholar 

  21. K. Ogata and K. Futatsugi. Operational semantics of rewriting with the on-demand evaluation strategy. In Proc of 2000 International Symposium on Applied Computing, SAC’00, pages 756–763. ACM Press, 2000.

    Google Scholar 

  22. H. Zantema. Termination of context-sensitive rewriting. In Proc. of 8th International Conference on Rewriting Techniques and Applications, RTA’97, pages 172–186. Springer-Verlag, LNCS 1232, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DSIC, UPV, Camino de Vera s/n, E-46022, Valencia, Spain

    M. Alpuente, S. Escobar & S. Lucas

  2. AG Theoretische Informatik und Logik, Institut für Computersprachen, TU Wien, Favoritenstr. 9, E185/2 A-1040, Wien, Austria

    B. Gramlich

Authors
  1. M. Alpuente
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Escobar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. B. Gramlich
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. S. Lucas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Abteilung für Theoretische Informatik, Institut für Algebra und Diskrete Mathematik, Wiedner Hauptstr. 8-10, 1040, Wien, Austria

    Matthias Baaz

  2. Department of Computer Science, University of Manchester, Kilburn Building, Oxford Road, Manchester, M13, 9PL, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alpuente, M., Escobar, S., Gramlich, B., Lucas, S. (2002). Improving On-Demand Strategy Annotations. In: Baaz, M., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2002. Lecture Notes in Computer Science(), vol 2514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36078-6_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-36078-6_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00010-5

  • Online ISBN: 978-3-540-36078-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation