We present a new proof of the standardization theorem in lambda-calculus, 
which is performed by inductions based on an inductive definition of
beta-reducibility with a standard sequence.