 The lambda calculus may be seen as an idealised version of a functional programming language, like Haskell or Standard ML.Under this view, β-reduction corresponds to a computational step.This step can be repeated by additional β-reductions until there are no more applications left to reduce.