DocumentCode :
2597692
Title :
A sufficient condition for the termination of the direct sum of term rewriting systems
Author :
Middeldorp, Aart
Author_Institution :
Dept. of Math. & Comput. Sci., Free Univ., Amsterdam, Netherlands
fYear :
1989
fDate :
5-8 Jun 1989
Firstpage :
396
Lastpage :
401
Abstract :
The author proves a conjecture by Rusinowitch (1987) stating that the direct sum of two terminating term-rewriting systems is terminating if one of the systems contains neither collapsing nor duplicating rules
Keywords :
rewriting systems; collapsing rules; direct sum; duplicating rules; term rewriting systems; termination; Computer science; Mathematics; Stress; Sufficient conditions;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Logic in Computer Science, 1989. LICS '89, Proceedings., Fourth Annual Symposium on
Conference_Location :
Pacific Grove, CA
Print_ISBN :
0-8186-1954-6
Type :
conf
DOI :
10.1109/LICS.1989.39194
Filename :
39194
Link To Document :
بازگشت