Go home now Header Background Image
Submission Procedure
share: |
Follow us
Volume 3 / Issue 11

available in:   PDF (252 kB) PS (91 kB)
Similar Docs BibTeX   Write a comment
Links into Future
DOI:   10.3217/jucs-003-11-1134


Persistency of Confluence

Takahito Aoto (JAIST, Japan)

Yoshihito Toyama (JAIST, Japan)

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: confluence, modularity, persistency, term rewriting system

Categories: F.4.1