In abstract rewriting, a normal form is an element of the system which cannot be rewritten any further. Stated formally, for some reduction relation ⋅ → ⋅ over X a term t in X is a normal form if there does not exist a term t′ in X such that t → t′.
Consider the basic term rewriting system with reduction rule ρ : g(x, y) → x. The term g(g(4, 2), g(3, 1)) has the following reduction sequence, according to the usual outermost strategy, that is, if the reduction rule is applied to each outermost occurrence of g:
There is no rule that permits us to rewrite 4, so 4 is a normal form for this term rewriting system.
Related concepts refer to the possibility of rewriting an element into normal form. Weak normalization means that some element can be rewritten into a normal form. Strong normalization means that any reduction sequence starting from some element terminates. We say that the system is weakly normalizing (or strongly normalizing) if all elements are weakly normalizing (resp. strongly normalizing).
Newman's lemma states that if an abstract reduction system A is strongly normalizing and is weakly confluent, then A is in fact confluent. The result enables us to further generalize the critical pair lemma.
Famous quotes containing the words normal and/or form:
“I don’t mind saying in advance that in my opinion jealousy is normal and healthy. Jealousy arises out of the fact that children love. If they have no capacity to love, then they don’t show jealousy.”
—D.W. Winnicott (20th century)
“A true poem is distinguished not so much by a felicitous expression, or any thought it suggests, as by the atmosphere which surrounds it. Most have beauty of outline merely, and are striking as the form and bearing of a stranger; but true verses come toward us indistinctly, as the very breath of all friendliness, and envelop us in their spirit and fragrance.”
—Henry David Thoreau (1817–1862)