In mathematics, in the theory of rewriting systems, Newman's lemma, also commonly called the diamond lemma, states that a terminating abstract rewriting system, that is, one in which there are no infinite reduction sequences, is confluent if it is... Wikipedia