Complete Call-by-Value Calculi of Control Operators II: Strong Termination

07/07/2017

∙

by   Ryu Hasegawa, et al.

∙

0

∙

share

We provide characterization of the strong termination property of the CCV lambda-mu calculus introduced in the first part of the series of the paper. The calculus is complete with respect to the standard CPS semantics. The union-intersection type systems for the calculus is developed in the previous paper. We characterize the strong normalizability of terms of the calculus in terms of the CPS semantics and typeability.