 Doing the same but in applicative order yields (λ"f".f I) (λy.y I (y I)), (λy.y I (y I)) I, I I (I I), and now work is duplicated.Lévy shows the existence of lambda terms where there "does not exist" a sequence of reductions which reduces them without duplicating work.The below lambda term is such an example.