Simplified Proof of Toyama's Theorem

摘要

A simple proof of a result of Toyama which states that the disjoint unions of confluent term rewriting systems are confluent is presented. The essential term rewriting background is reviewed and some specific notations concerning disjoint sums are introduced. The proof is given in three distinct steps: presentation, confluence of inner preserved terms, and modularity of confluence.