Termination of context-sensitive rewriting

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

Volumn 1232, Issue , 1997, Pages 172-186

  Zantema, H ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

AUTOMATIC TECHNIQUE; CONTEXT SENSITIVE; CONTEXT SENSITIVE REWRITING; FUNCTION SYMBOLS; ORIGINAL SYSTEMS; TERM REWRITING; WELL-FOUNDED ORDERINGS;

ARTIFICIAL INTELLIGENCE;

EID: 84947711132     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62950-5_69     Document Type: Conference Paper

References (10)

1. Arts, T., and Giesl, J. Termination of constructor systems. In Proceedings of the 7th Conference on Rewriting Techniques and Applications (1996), vol. 1103 of Lecture Notes in Computer Science, Springer, pp. 63-77.
2. Bellegarde. F., and Lescanne, P. Termination by completion. Applicable Algebra in Engineering, Communication and Computing 1, 2 (1990), 79-96.
3. Ben-Cherifa, A., and Lescanne, P. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computing Programming 9, 2 (1987), 137-159.
4. Dershowitz, N. Termination of rewriting. Journal of Symbolic Computation 3, 1 and 2 (1987), 69-116.
5. Lucas, S. Fundamentals of context-sensitive rewriting. In Proceedings of the 22nd Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM95) (1995), J. S. M. Bartosek and J. Wiedermann, Eds., vol. 1012 of Lecture Notes in Computer Science, Springer, pp. 405 - 412.
6. Lucas, S. Context-sensitive computations in confluent programs. In Proceedings of the 8th International Symposium on Programming Languages: Implementations, Logics and Programs (PLILP96) (1996), H. Kuchen and S. D. Swierstra, Eds., vol. 1140 of Lecture Notes in Computer Science, Springer, pp. 408-422.
7. Lucas, S. Termination of context-sensitive rewriting by rewriting. In Proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP96) (1996), F. Meyer auf der Heide and B. Monien, Eds., vol. 1099 of Lecture Notes in Computer Science, Springer, pp. 122 - 133.
8. Steinbach. J. Simplification orderings: history of results. Fundamenta Informaticae 24 (1995), 47-87.
9. Zantema, H. Termination of term rewriting: interpretation and type elimination. Journal of Symbolic Computation 17 (1994), 23-50.
10. Zantema, H. Termination of term rewriting by semantic labelling. Fundamenta Informaticaeê (1995), 89-105