 For the untyped lambda calculus, β-reduction as a rewriting rule is neither strongly normalising nor weakly normalising.However, it can be shown that β-reduction is confluent when working up to α-conversion (i.e.we consider two normal forms to be equal if it is possible to α-convert one into the other).