A parameterization with such a transformation rule is called flat.

In older texts this transformation rule often serves as the definition of a tensor.

This is the explicit form of the covariant transformation rule.

However, lambda calculus emphasizes the use of transformation rules.

These transformation rules can be viewed as an equational theory or as an operational definition.

The set of transformation rules, , is described as follows:

In describing the transformation rules, we may introduce a metalanguage symbol .

A proof is complete if every line follows from the previous ones by the correct application of a transformation rule.

One could spend many hours applying these transformation rules to strings.

A set of data cleansing and transformation rules which have been seen to produce data which is all fit for purpose.