Type and effect systems are a tool to analyse statically the behaviour of programs witheffects. We present a proof based on the so called reducibility candidates that a suitablestratification of the type and effect system entails the termination of the typable programs.The proof technique covers a simply typed, multi-threaded, call-by-value lambda-calculus,equipped with a va...