  The aim of this work is to characterize three fundamental normalization
proprieties in lambda-calculus trough the Taylor expansion of $ \lambda$-terms.
The general proof strategy consists in stating the dependence of ordinary
reduction strategies on their resource counterparts and in finding a convenient
resource term in the Taylor expansion that behaves well under the considered
kind of reduction.
