Normal order is a common evaluation strategy in lambda calculi. Normal order means evaluating the leftmost, outermost lambdas first, evaluating nested terms after you’ve run out of arguments to apply. Normal order isn’t how Haskell code is evaluated. Haskell’s evaluation strategy is call-by-need, instead.
Normal order is a common evaluation strategy in lambda calculi. Normal order means evaluating the leftmost, outermost lambdas first, evaluating nested terms after you’ve run out of arguments to apply. Normal order isn’t how Haskell code is evaluated. Haskell’s evaluation strategy is call-by-need, instead.