The Church-Rosser property for ground term-rewriting systems is decidable☆

https://doi.org/10.1016/0304-3975(87)90100-9Get rights and content
Under an Elsevier user license
open archive

Abstract

A term-rewriting system is said to be a ground system if no variable occurs in any of its rewrite rules. This paper shows that the Church-Rosser Property (i.e., confluence) problem for ground term-rewriting systems is decidable. This is an affirmative solution to this problem posed by Huet and Oppen (1980).

Cited by (0)

☆

This research was supported in part by Grant-in-Aid for Scientific Research No. 58580025 from the Ministry of Education, Science and Culture, Japan, and by the Alexander von Humboldt Foundation.

Copyright © 1987 Published by Elsevier B.V.