OnDemandOBJ: A laboratory for strategy annotations

Electronic Notes in Theoretical Computer Science

Volumn 86, Issue 2, 2003, Pages 1-27

  Alpuente, María ^a   Escobar, Santiago ^a   Lucas, Salvador ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CODES (SYMBOLS); COMPUTATIONAL METHODS; MATHEMATICAL MODELS; MECHANIZATION; SET THEORY;

EAGER RULE-BASED PROGRAMMING LANGUAGES; NEGATIVE ANNOTATIONS; ONDEMANDOBJ; PROGRAM TRANSFORMATION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 1842577968     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80673-X     Document Type: Conference Paper

References (20)

1. M. Alpuente, S. Escobar, B. Gramlich, and S. Lucas. Improving on-demand strategy annotations. In M. Baaz and A. Voronkov, editors, Proc. 9th Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'02), volume 2514 of Lecture Notes in Computer Science, pages 1-18, Tbilisi, Georgia, 2002. Springer-Verlag, Berlin.
2. M. Alpuente, S. Escobar, and S. Lucas. Correct and complete (positive) strategy annotations for OBJ. In J. Giavitto and P. Moreau, editors, Proc. of the 4th International Workshop on Rewriting Logic and its Applications, WRLA 2002, volume 71 of Electronic Notes in Theoretical Computer Science. Elsevier Sciences Publisher, 2002.
3. M. Alpuente, S. Escobar, and S. Lucas. On-demand evaluation by program transformation. In J. Giavitto and P. Moreau, editors, Proc. of the 4th International Workshop on Rule-Based Programming, RULE 2003, volume 86.2 of Electronic Notes in Theoretical Computer Science. Elsevier Sciences Publisher, 2003.
4. S. Antoy and S. Lucas. Demandness in rewriting and narrowing. In M. Comini and M. Falaschi, editors, Proc. of the 11th Int'l Workshop on Functional and (Constraint) Logic Programming WFLP'02, volume 76 of Electronic Notes in Theoretical Computer Science. Elsevier Sciences Publisher, 2002.
5. T. Arts and J. Giesl. A collection of examples for termination of term rewriting using dependency pairs. Technical report, AIB-2001-09, RWTH Aachen, Germany, 2001.
6. M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. In J. Meseguer, editor, Proc. of the 1st International Workshop on Rewriting Logic and its Applications, RWLW 96, volume 4 of Electronic Notes in Theoretical Computer Science, pages 65-89. Elsevier Sciences Publisher, 1996.
7. S. Eker. Term rewriting with operator evaluation strategies. In C. Kirchner and H. Kirchner, editors, Proc. of the 2nd International Workshop on Rewriting Logic and its Applications, WRLA 98, volume 15 of Electronic Notes in Theoretical Computer Science. Elsevier Sciences Publisher, 2000.
8. Fokkink W., Kamperman J., Walters P. Lazy rewriting on eager machinery. ACM Transactions on Programming Languages and Systems. 22:(1):2000;45-86
9. K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Proc. of 12th Annual ACM Symp. on Principles of Programming Languages (POPL'85), pages 52-66. ACM Press, New York, 1985.
10. K. Futatsugi and A. Nakagawa. An overview of CAFE specification environment - an algebraic approach for creating, verifying, and maintaining formal specification over networks -. In 1st International Conference on Formal Engineering Methods, 1997.
11. Goguen J., Winkler T., Meseguer J., Futatsugi K., Jouannaud J.-P. Introducing OBJ. Goguen J., Malcolm G. Software Engineering with OBJ: algebraic specification in action. 2000;Kluwer Academic Publishers, Dordrecht, The Netherlands
12. Kennaway J., de Vries F. Infinitary rewriting. TeReSe. Term Rewriting Systems, chapter 11. 2003;Cambridge University Press
13. S. Lucas. Termination of on-demand rewriting and termination of obj programs. In Proc. of 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP'01, pages 82-93. ACM Press, New York, 2001.
14. Lucas S. Context-sensitive rewriting strategies. Information and Computation. 178:(1):2002;294-343
15. S. Lucas. Lazy rewriting and context-sensitive rewriting. In M. Hanus, editor, Proc. of the 10th Int'l Workshop on Functional and (Constraint) Logic Programming WFLP'01, volume 64 of Electronic Notes in Theoretical Computer Science. Elsevier Sciences Publisher, 2002.
16. S. Lucas. Termination of (Canonical) Context-Sensitive Rewriting. In S. Tison, editor, Proc. of 13th International Conference on Rewriting Techniques and Applications, RTA'02, volume 2378 of Lecture Notes in Computer Science, pages 296-310. Springer-Verlag, Berlin, 2002.
17. T. Nagaya. Reduction Strategies for Term Rewriting Systems. PhD thesis, School of Information Science, Japan Advanced Institute of Science and Technology, March 1999.
18. M. Nakamura and K. Ogata. The evaluation strategy for head normal form with and without on-demand flags. In K. Futatsugi, editor, Proc. of the 3rd International Workshop on Rewriting Logic and its Applications, WRLA 2000, volume 36 of Electronic Notes in Theoretical Computer Science. Elsevier Sciences Publisher, 2001.
19. K. Ogata and K. Futatsugi. Operational semantics of rewriting with the ondemand evaluation strategy. In Proc. of 2000 International Symposium on Applied Computing, SAC'00, pages 756-763. ACM Press, New York, 2000.
20. H. Zantema. Termination of context-sensitive rewriting. In Proc. of 8th International Conference on Rewriting Techniques and Applications, RTA'97, volume 1232 of Lecture Notes in Computer Science, pages 172-186. Springer-Verlag, Berlin, 1997.