Paper: A sufficient condition for the termination of the direct sum of term rewriting systems (at LICS 1989)
Authors: Middeldorp, A.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
BibTeX
@InProceedings{Middeldorp-Asufficientconditio, author = {Middeldorp, A.}, title = {A sufficient condition for the termination of the direct sum of term rewriting systems }, booktitle = {Proceedings of the Fourth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1989}, year = 1989, editor = {Rohit Parikh}, month = {June}, pages = {396--401}, location = {Pacific Grove, CA, USA}, publisher = {IEEE Computer Society Press} }