 This is in contrast to, say, a program that loops infinitely without ever providing output.These two procedures have very different intuitive meanings.Since a computation described using lambda calculus is the process of reducing a lambda term to its normal form, this normal form itself is the result of the computation, and the entire process may be considered as "evaluating" the original term.