A property P of term rewriting systems (TRSs, for short) is said to be persistent if for any many-sorted TRS R, R has the property P if and only if its underlying unsorted TRS (R) has the property P. This notion was introduced by H. Zantema (1994). In this paper, it is shown that confluence is persistent.
|Number of pages||14|
|Journal||Journal of Universal Computer Science|
|Publication status||Published - 1997 Dec 1|
- Term rewriting system
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)