Newman's lemma

In theoretical computer science the Diamond Lemma states (also: the set of Newman, according to Max Newman ) that a well-founded relation is confluent if and only if it is locally confluent.

This result is the basis for the decidability of confluence for terminating term rewriting systems.

Since the diagram looks in the proof of this theorem away to a diamond, he got this name.

• Theoretical computer science