Correct and complete (positive) strategy annotations for OBJ

Electronic Notes in Theoretical Computer Science

Volumn 71, Issue , 2004, Pages 70-89

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

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

Author keywords

Declarative programming; OBJ; Strategy annotations

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; SET THEORY;

DECLARATIVE PROGRAMMING; OBJ; PROGRAM TRANSFORMATIONS; STRATEGY ANNOTATIONS;

STRATEGIC PLANNING;

EID: 12344291481     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)82529-0     Document Type: Conference Paper

References (21)

1. Baader F., Nipkow T. Term Rewriting and All That. 1998;Cambridge University Press
2. Borralleras C., Lucas S., Rubio A. Recursive Path Orderings can be Context-Sensitive. Voronkov A. Proc. of 18th International Conference on Automated Deduction, CADE′02, LNAI. 2392:2002;314-331 Springer-Verlag, Berlin
3. Clavel M., Eker S., Lincoln P., Meseguer J. Principles of Maude. Electronic Notes in Theoretical Computer Science. 4:1996;Elsevier Sciences
4. Eker S. Term Rewriting with Operator Evaluation Strategies. Electronic Notes in Theoretical Computer Science. 15:1998;Elsevier Sciences
5. Fissore O., Gnaedig I., Kirchner H. Induction for termination with local strategies. Electronic Notes in Theoretical Computer Science. 58:2001;Elsevier Sciences. (2)
6. Futatsugi K., Goguen J. Principles of OBJ2. Conference Record of the 12th Annual ACM Symposium on Principles of Programming Languages, POPL′85. 1985;52-66 ACM Press
7. K. Futatsugi, 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.
8. Goguen J.A., 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
9. Lucas S. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming. 1:1998;1-61 The MIT Press
10. S. Lucas. Context-sensitive rewriting strategies. Information and Computation, Academic Press, to appear.
11. S. Lucas. Rewriting with replacement restrictions. PhD Thesis, DSIC, Universidad Politécnica de Valencia, in spanish, October 1998.
12. Lucas S. Termination of (Canonical) Context-Sensitive Rewriting. Sophie Tison. Proc. 13th International Conference on Rewriting Techniques and Applications (RTA′02). 2002;296-310 Springer-Verlag, Berlin. LNCS 2378
13. Lucas S. Termination of on-demand rewriting and termination of OBJ programs. Proc. of 3rd International Conference on Principles and Practice of Declarative Programming, PPDP′01. 2001;82-93 ACM Press
14. Lucas S. Termination of Rewriting With Strategy Annotations. Nieuwenhuis R., Voronkov A. Proc. of 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR′01, L0NAI 2250. 2001;669-684 Springer-Verlag, Berlin
15. Lucas S. Transfinite Rewriting Semantics for Term Rewriting Systems. Middeldorp A. Proc. of 12th International Conference on Rewriting Techniques and Applications, RTA′01, LNCS 2051. 2001;216-230 Springer-Verlag, Berlin
16. Lucas S. Transformations for Efficient Evaluations in Functional Programming. Glaser H., Hartel P. Proc of 9th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP′97, LNCS 1292. 1997;127-141 Springer-Verlag, Berlin
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. Nakamura M., Futatsugi K. Completeness and strictness analysis for the evaluation strategy. Toyama Y. Proc. of 1th International Workshop on Rewriting y Proof and Computation, RPC′01. 2001;80-89 RIEC, Tohoku University
19. Nakamura M., Ogata K. The evaluation strategy for head normal form with and without on-demand flags. Electronic Notes in Theoretical Computer Science. 36:2001;Elsevier Sciences
20. Ogata K., Futatsugi K. Implementation of Term Rewritings with the Evaluation Strategy. Glaser H., Hartel P. Proc of 9th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP′97, LNCS 1292. 1997;225-239 Springer-Verlag, Berlin
21. van de Pol J. Just-in-time: on Strategy Annotations. Electronic Notes in Theoretical Computer Science. 57:2001;Elsevier Sciences