Improving on-demand strategy annotations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2514, Issue , 2002, Pages 1-18

  Alpuente, M ^a   Escobar, S ^a   Gramlich, B ^b   Lucas, S ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Declarative programming; Demandness; Lazy evaluation; OBJ; On demand strategy annotations

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; COMPUTER PROGRAMMING;

COMPUTATIONAL PROPERTIES; DECLARATIVE PROGRAMMING; DEMANDNESS; EVALUATION STRATEGIES; FUNCTIONAL LANGUAGES; LAZY EVALUATION; ON-DEMAND STRATEGY ANNOTATIONS; STRATEGY ANNOTATIONS;

COMPUTER CIRCUITS;

EID: 84954409759     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36078-6_1     Document Type: Conference Paper

References (22)

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.
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.
3. S. Antoy and S. Lucas. Demandness in rewriting and narrowing. Electronic Notes in Theoretical Computer Science, volume 76. Elsevier Sciences, to appear 2002.
4. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
5. M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. Electronic Notes in Theoretical Computer Science, volume 4. Elsevier Sciences, 1996.
6. S. Eker. Term rewriting with operator evaluation strategies. Electronic Notes in Theoretical Computer Science, volume 15. Elsevier Sciences, 1998.
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.
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.
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.
10. B. Gramlich and S. Lucas. Modular termination of context-sensitive rewriting. In C. Kirchner, editor, Proc. of 4th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP’02, Pittsburg, USA, 2002. ACM Press, New York. To appear, 2002.
11. Jürgen Giesl and Aart Middeldorp. Transformation techniques for context-sensitive rewrite systems. Aachener Informatik-Berichte (AIBs) 2002-02, RWTH Aachen, 2002.
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.
13. S. Lucas. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming, 1998:1–61, 1998.
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.
15. S. Lucas. Context-sensitive rewriting strategies. Information and Computation, to appear, 2002.
16. S. Lucas. Lazy rewriting and context-sensitive rewriting. Electronic Notes in Theoretical Computer Science, volume 64. Elsevier Sciences, to appear, 2002.
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.
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.
19. T. Nagaya. Reduction Strategies for Term Rewriting Systems, PhD Thesis. School of Information Science, Japan Advanced Institute of Science and Technology, 1999.
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.
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.
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.