Normal order is a term primarily used in the context of programming languages and computational theory, particularly in relation to lambda calculus and functional programming. In lambda calculus and other functional programming paradigms, the term "normal order" refers to the evaluation strategy where you reduce expressions by always evaluating the outermost function applications first before evaluating the arguments. This is in contrast to "applicative order," where the arguments of a function are evaluated first before the function itself is invoked.
New to topics? Read the docs here!