Abstract

Toyama proved that confluence is a modular property of term rewriting systems. This means that the disjoint union of two confluent term rewriting systems is again confluent. In this paper we extend his result to the class of conditional term rewriting systems. In view of the important role of conditional rewriting in equational logic programming, this result may be of relevance in integrating functional programming and logic programming.

BibTeX Entry

@inproceedings{M-CTRS90,
 author    = "Aart Middeldorp",
 title     = "Confluence of the Disjoint Union of Conditional Term
              Rewriting Systems",
 booktitle = "Proceedings of the 2nd International Workshop on
              Conditional Term Rewriting Systems",
 series    = "Lecture Notes in Computer Science",
 volume    = 516,
 pages     = "295--306",
 year      = 1991,
 doi       = "10.1007/3-540-54317-1\_99"
}