JUCS - Journal of Universal Computer Science 3(11): 1134-1147, doi: 10.3217/jucs-003-11-1134
Persistency of Confluence
expand article infoTakahito Aoto‡, Yoshihito Toyama‡
‡ JAIST, Japan

Corresponding author: Takahito Aoto ( aoto@jaist.ac.jp )

© Takahito Aoto, Yoshihito Toyama.
This article is freely available under the J.UCS Open Content License.
Citation: Aoto T, Toyama Y (1997) Persistency of Confluence. JUCS - Journal of Universal Computer Science 3(11): 1134-1147. https://doi.org/10.3217/jucs-003-11-1134
Open Access
Abstract
A property of term rewriting systems (TRSs, for short) is said to be persistent if for any many-sorted TRS has the property if and only if its underlying unsorted TRS has the property . This notion was introduced by H. Zantema (1994). In this paper, it is shown that confluence is persistent. 1.) Proceedings of the First Japan-New Zealand Workshop on Logic in Computer Science, special issue editors D.S. Bridges, C.S. Calude, M.J. Dinneen and B. Khoussainov.
Keywords
term rewriting system, persistency, confluence, modularity