Under the typed lambda-calculus, beta/delta reduction of the left-most redex (normal order reduction) is guaranteed to terminate with a head normal form if one exists. See also Church-Rosser theorem.

In addition suitable contents:
[ ad ] [ al ] [ am ] [ an ] [ ar ] [ at ] [ b ] [ bd ] [ be ] [ beta ] [ C ] [ ca ] [ Ch ] [ ch ] [ cu ] [ de ] [ delta ] [ delta reduction ] [ du ] [ ed ] [ edu ] [ ee ] [ er ] [ et ] [ fo ] [ for ] [ gu ] [ h ] [ hu ] [ in ] [ io ] [ is ] [ it ] [ la ] [ lambda-calculus ] [ lc ] [ ls ] [ lt ] [ lu ] [ ma ] [ mo ] [ na ] [ ne ] [ no ] [ norm ] [ normal form ] [ normal order reduction ] [ pe ] [ rc ] [ re ] [ redex ] [ reduction ] [ S ] [ se ] [ so ] [ st ] [ tee ] [ th ] [ to ] [ type ] [ typed lambda-calculus ] [ ua ] [ us ]