Transforming context-sensitive rewrite systems

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

Volumn 1631, Issue , 1999, Pages 271-285

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

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CONTEXT SENSITIVE; CONTEXT SENSITIVE REWRITING; REWRITE SYSTEMS; SOUND AND COMPLETE; TERM REWRITE SYSTEMS; TRANSFORMATION TECHNIQUES;

ARTIFICIAL INTELLIGENCE;

EID: 84957628750     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48685-2_23     Document Type: Conference Paper

References (17)

1. T. Arts and J. Giesl. Automatically proving termination where simplification orderings fail. In Proceedings of the 7th International Joint Conference on the Theory and Practice of Software Development, volume 1214 of LNCS, pages 261-273, 1997.
2. T. Arts and J. Giesl. Proving innermost normalisation automatically. In Proceedings of the 8th International Conference on Rewriting Techniques and Applications, volume 1232 of LNCS, pages 157-172, 1997.
3. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 1999. To appear.
4. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
5. N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:279-301, 1982.
6. N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3:69-116, 1987.
7. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In Handbook of Theoretical Computer Science, volume B, pages 243-320. Elsevier, 1990.
8. B. Gramlich. Abstract relations between restricted termination and confluence properties of rewrite systems. Fundamenta Informaticae, 24:3-23, 1995.
9. J. W. Klop. Term rewriting systems. In Handbook of Logic in Computer Science, Vol. 2, pages 1-116. Oxford University Press, 1992.
10. S. Lucas. Termination of context-sensitive rewriting by rewriting. In Proceedings of the 23rd International Colloquium on Automata, Languages and Programming, volume 1099 of LNCS, pages 122-133, 1996.
11. S. Lucas. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming, 1:1-61, 1998.
12. A. Middeldorp, H. Ohsaki, and H. Zantema. Transforming termination by self-labelling. In Proceedings of the 13th International Conference on Automated Deduction, volume 1104 of LNAI, pages 373-387, 1996.
13. H. Ohsaki and A. Middeldorp. Type introduction for equational rewriting. In Proceedings of the 4th Symposium on Logical Foundations of Computer Science, volume 1234 of LNCS, pages 283-293, 1997.
14. J. Steinbach. Simplification orderings: History of results. Fundamenta Informaticae, 24:47-87, 1995.
15. Y. Toyama. Counterexamples to the termination for the direct sum of term rewriting systems. Information Processing Letters, 25:141-143, 1987.
16. H. Zantema. Termination of term rewriting: Interpretation and type elimination. Journal of Symbolic Computation, 17:23-50, 1994.
17. H. Zantema. Termination of context-sensitive rewriting. In Proceedings of the 8th International Conference on Rewriting Techniques and Applications, volume 1232 of LNCS, pages 172-186, 1997.