Transformation techniques for context-sensitive rewrite systems

Journal of Functional Programming

Volumn 14, Issue 4, 2004, Pages 379-427

  Giesl, Jürgen ^a   Middeldorp, Aart ^b,c  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF TSUKUBA   (Japan)

^c UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT-SENSITIVE REWRITING; FUNCTIONAL PROGRAMMING; MODULO ASSOCIATIVITY; NORMALIZATION; TERMINATION ANALYSIS;

ALGORITHMS; DATA STRUCTURES; MATHEMATICAL TRANSFORMATIONS; MODULA (PROGRAMMING LANGUAGE); SEMANTICS; SET THEORY; TRANSLATION (LANGUAGES);

CONTEXT SENSITIVE LANGUAGES;

EID: 3042804926     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796803004945     Document Type: Review

References (48)

1. Arts, T. and Giesl, J. (2000) Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236, 133-178.
2. Baader, F. and Nipkow, T. (1998) Term Rewriting and All That. Cambridge University Press.
3. Bellegarde, F. and Lescanne, P. (1990) Termination by completion. Applicable Algebra in Engineering, Communication and Computing, 1, 79-96.
4. Ben Cherifa, A. and Lescanne, P. (1987) Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9, 137-159.
5. Borralleras, C., Ferreira, M. and Rubio, A. (2000) Complete monotonic semantic path orderings. Proceedings 17th International Conference on Automated Deduction: Lecture Notes in Artificial Intelligence 1831, pp. 346-364.
6. Borralleras, C., Lucas, S. and Rubio, A. (2002) Recursive path orderings can be context-sensitive. Proceedings 18th International Conference on Automated Deduction: Lecture Notes in Artificial Intelligence 2392, pp. 314-331.
7. Clavel, M., Eker, S., Lincoln, P. and Meseguer, J. (1996) Principles of Maude. Proc. 1st WRLA, Electr. Notes in Theor. Comput. Sci. 4.
8. Contejean, E., Marché, C., Monate, B. and Urbain, X. (2000) CME version 2. Available at http://cime.lri.fr/.
9. Dershowitz, N. (1982) Orderings for term-rewriting systems. Theoretical Computer Science, 17, 279-301.
10. Dershowitz, N. (1987) Termination of rewriting. J. Symbolic Computation, 3, 69-116.
11. Dershowitz, N. and Hoot, C. (1995) Natural termination. Theoretical Computer Science, 142(2), 179-207.
12. Diaconescu, R. and Futatsugi, K. (1998) CafeOBJ Report: The language, proof techniques, and methodologies for object-oriented algebraic specification. AM AST Series in Computing, vol. 6. World Scientific.
13. Ferreira, M. C. F. and Ribeiro, A. L. (1999) Context-sensitive AC-rewriting. Proceedings 10th International Conference on Rewriting Techniques and Applications: Lecture Notes in Computer Science 1631, pp. 173-187.
14. Fokkink, W. J., Kamperman, J. F. Th. and Walters, H. R. (2000) Lazy rewriting on eager machinery. ACM Trans. Program. Lang. Syst. 22(1), 45-86.
15. Giesl, J. (1995) Generating polynomial orderings for termination proofs. Proceedings 6th International Conference on Rewriting Techniques and Applications: Lecture Notes in Computer Science 914, pp. 426-431.
16. Giesl, J. and Kapur, D. (2001) Dependency pairs for equational rewriting. Proceedings 12th International Conference on Rewriting Techniques and Applications: Lecture Notes in Computer Science 2051, pp. 93-107.
17. Giesl, J. and Middeldorp, A. (1999) Transforming context-sensitive rewrite systems. Proceedings 10th International Conference on Rewriting Techniques and Applications: Lecture Notes in Computer Science 1631, pp. 271-285.
18. Giesl, J. and Middeldorp, A. (2002) Transformation techniques for context-sensitive rewrite systems. Technical report AIB-2002-02, RWTH Aachen, Germany. Available from http://aib.informatik.rwth-aachen.de.
19. Giesl, J. and Middeldorp, A. (2003) Innermost termination of context-sensitive rewriting. Proceedings 6th International Conference on Developments in Language Theory: Lecture Notes in Computer Science 2450, pp. 231-244.
20. Giesl, J., Arts, T. and Ohlebusch, E. (2002) Modular termination proofs for rewriting using dependency pairs. J. Symbolic Computation, 34(1), 21-58.
21. Goguen, J., Winkler, T., Meseguer, J., Futatsugi, K. and Jouannaud, J.-P. (2000) Introducing OBJ. In: Goguen, J. and Malcolm, G., editors, Software Engineering with OBJ: Algebraic specification in action. Kluwer.
22. Gramlich, B. and Lucas, S. (2002a) Modular termination of context-sensitive rewriting. Proceedings 4th International Conference on Principles and Practice of Declarative Programming, pp. 50-61. ACM Press.
23. Gramlich, B. and Lucas, S. (2002b) Simple termination of context-sensitive rewriting. Proceedings 3rd ACM SIGPLAN Workshop on Rule-Based Programming, pp. 29-42.
24. Hong, H. and Jakus, D. (1998) Testing positiveness of polynomials. J. Automated Reasoning, 21, 23-28.
25. Jones, N. D. and Glenstrup, A. J. (2002) Program generation, termination, and binding-time analysis. Proceedings ACM SIGPLAN/SIGSOFT Conference on Generative Programming and Component Engineering: Lecture Notes in Computer Science 2487, pp. 1-31.
26. Kapur, D. and Sivakumar, G. (1997) A total ground path ordering for proving termination of AC-rewrite systems. Proceedings 8th International Conference on Rewriting Techniques and Applications: Lecture Notes in Computer Science 1231, pp. 142-156.
27. Kapur, D., Sivakumar, G. and Zhang, H. (1995) A path ordering for proving termination of AC-rewrite systems. J. Automated Reasoning, 14, 293-316.
28. Knuth, D. E. and Bendix, P. (1970) Simple word problems in universal algebras. In: Leech, J., editor, Computational Problems in Abstract Algebra, pp. 263-297. Pergamon Press.
29. Kusakari, K. and Toyama, Y. (2001) On proving AC-termination by AC-dependency pairs. IEICE Trans. Infor. Syst. E84-D(5), 604-612.
30. Lankford, D. (1979) On proving term rewriting systems are Noetherian. Technical report, MTP-3. Louisiana Technical University, Ruston, LA, USA.
31. Lucas, S. (1996) Termination of context-sensitive rewriting by rewriting. Proceedings 23rd International Colloquium on Automata, Languages and Programming: Lecture Notes in Computer Science 1099, pp. 122-133.
32. Lucas, S. (1998) Context-sensitive computations in functional and functional logic programs. J. Functional & Logic Program. 1, 1-61.
33. Lucas, S. (2001a) Termination of on-demand rewriting and termination of OBJ programs. Proceedings 3rd International Conference on Principles and Practice of Declarative Programming, pp. 82-93. ACM Press.
34. Lucas, S. (2001b) Termination of rewriting with strategy annotations. Proceedings 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning: Lecture Notes in Artificial Intelligence 2250, pp. 669-684.
35. Lucas, S. (2002a) Lazy rewriting and context-sensitive rewriting. 10th International Workshop on Functional and (Constraint) Logic Programming. Electr. Notes in Theor. Comput. Sci. 64.
36. Lucas, S. (2002b) Termination of (canonical) context-sensitive rewriting. Proceedings 13th International Conference on Rewriting Techniques and Applications: Lecture Notes in Computer Science 2378, pp. 296-310.
37. Marché, C. and Urbain, X. (1998) Termination of associative-commutative rewriting by dependency pairs. Proceedings 9th International Conference on Rewriting Techniques and Applications: Lecture Notes in Computer Science 1379, pp. 241-255
38. Middeldorp, A. and Ohsaki, H. (2000) Type introduction for equational rewriting. Acta Informatica, 36(12), 1007-1029.
39. Middeldorp, A., Ohsaki, H. and Zantema, H. (1996) Transforming termination by self-labelling. Proceedings 13th International Conference on Automated Deduction: Lecture Notes in Artificial Intelligence 1104, pp. 373-387.
40. Plasmeijer, R. and van Eekelen, M. (1993) Functional Programming and Parallel Graph Rewriting. Addison Wesley.
41. Rubio, A. (2002) A fully syntactic AC-RPO. Infor. & Computation, 178, 515-533.
42. Rubio, A. and Nieuwenhuis, R. (1995) A total AC-compatible ordering based on RPO. Theor. Comput. Sci. 142, 209-227.
43. Steinbach, J. (1994) Generating polynomial orderings. Infor. Process. Lett. 49, 85-93.
44. Steinbach, J. (1995) Simplification orderings: History of results. Fundamenta Informaticae, 24, 47-87.
45. Toyama, Y. (1987) Counterexamples to the termination for the direct sum of term rewriting systems. Infor. Process. Lett. 25, 141-143.
46. Zantema, H. (1994) Termination of term rewriting: Interpretation and type elimination. J. Symbolic Computation, 17, 23-50.
47. Zantema, H. (1995) Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24, 89-105.
48. Zantema, H. (1997) Termination of context-sensitive rewriting. Proceedings of the 8th International Conference on Rewriting Techniques and Applications: Lecture Notes in Computer Science 1232, pp. 172-186.