Recursive path orderings can be context-sensitive

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

Volumn 2392, Issue , 2002, Pages 314-331

  Borralleras, Cristina ^a   Lucas, Salvador ^b   Rubio, Albert ^c  

^a UNIVERSITY OF VIC CENTRAL UNIVERSITY OF CATALONIA   (Spain)

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

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; MODELING LANGUAGES; THEOREM PROVING;

CONTEXT SENSITIVE; CONTEXT SENSITIVE REWRITING; PROGRAM VERIFICATION; RECURSIVE PATH ORDERING; REWRITE SYSTEMS; TRANSFORMATION METHODS;

CONTEXT SENSITIVE LANGUAGES;

EID: 84948973958     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45620-1_27     Document Type: Conference Paper

References (19)

1. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133–178, 2000.
2. Thomas Arts and Hans Zantema. Termination of logic programs using semantic unification. Fifth International Workshop on Logic Program Synthesis and Transformation, LNCS 1048:219–233. Springer, 1996.
3. F. Baader and T. Nipkow. Term Rewriting and all that. Cambridge University Press, 1998.
4. C. Borralleras, S. Lucas and A. Rubio. Recursive Path Orderings can be Context-Sensitive. Available at www.lsi.upc.es/˜albert/papers.html, 2002. Long version.
5. Max Dauchet. Simulation of turing machines by a regular rewrite rule. Theoretical Computer Science, 103(2):409–420, 1992.
6. Nachum Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279–301, 1982.
7. M.C.F. Ferreira and A.L. Ribeiro. Context-Sensitive AC-Rewriting. Proc. of 10th International Conference on Rewriting Techniques and Applications, LNCS 1631:286-300, Springer, 1999.
8. J. Giesl and A. Middeldorp. Transforming Context-Sensitive Rewrite Systems. Proc.of 10th International Conference on Rewriting Techniques and Applications, LNCS 1631:271–285, Springer, 1999.
9. J. Giesl and A. Middeldorp. Transforming Context-Sensitive Rewrite Systems. Proc.of 1th International Workshop on Rewriting Proof and Computation, RPC’01, pages 14-33, RIEC, Tohoku University, 2001.
10. Jean Goubault-Larrecq. Well-Founded Recursive Relations. Proc.15th Int.Workshop Computer Science Logic, LNCS 2142:484–497, Springer, 2001.
11. Harald Ganzinger and Uwe Waldmann. Termination proofs of well-moded logic programs via conditional rewrite systems. Proc.of 3rd International Workshop on Conditional Term Rewriting Systems, LNCS 656:113–127, Springer, 1993.
12. D.E. Knuth and P.B. Bendix. Simple word problems in universal algebras. In Computational Problems in Abstract Algebra, pages 263–297. Pergamon Press, 1970.
13. J. Kennaway and F.J. de Vries. Infinitary rewriting. In Term Rewriting Systems. Cambridge University Press, 2002. To appear.
14. S. Lucas. Termination of context-sensitive rewriting by rewriting. Proc. of 23rd.International Colloquium on Automata, Languages and Programming, ICALP’96, LNCS 1099:122-133, Springer, 1996.
15. S. Lucas. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming, 1998(1):1-61, 1998.
16. S. Lucas. Termination of Rewriting With Strategy Annotations. Proc. of 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LNAI 2250:669-684, Springer, 2001.
17. C. St. J. A. Nash-Williams. On well-quasi-ordering finite trees. Proceedings of the Cambridge Philosophical Society, 59(4):833–835, 1963.
18. J. Steinbach and H. Xi. Freezing – Termination Proofs for Classical, Context-Sensitive and Innermost Rewriting. Institut für Informatik, T.U. München, 1998.
19. H. Zantema. Termination of Context-Sensitive Rewriting. Proc.o f 8th International Conference on Rewriting Techniques and Applications, RTA’97, LNCS 1232:172-186, Springer, 1997.