Persistency of confluence 1

Takahito Aoto, Yoshihito Toyama

Research output: Contribution to journalArticlepeer-review

21 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)1134-1147
Number of pages14
JournalJournal of Universal Computer Science
Issue number11
Publication statusPublished - 1997 Dec 1


  • Confluence
  • Modularity
  • Persistency
  • Term rewriting system

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Persistency of confluence 1'. Together they form a unique fingerprint.

Cite this