an:01857119
Zbl 1018.68016
Nakazawa, Koji
Confluency and strong normalizability of call-by-value \(\lambda \mu\)-calculus
EN
Theor. Comput. Sci. 290, No. 1, 429-463 (2003).
00089932
2003
j
68N18
call-by-value -calculus; domain-free type system; confluency; strong normalizability; CPS-translation
Summary: This paper proves the confluency and the strong normalizability of the call-by-value \(\lambda \mu\)-calculus with the domain-free style. The confluency of the system is proved by improving the parallel reduction method of Baba et al. The strong normalizability is proved by using the modified CPS-translation, which preserves the typability and the reduction relation. This paper defines the class of the reductions whose strictness is preserved by the modified CPS-translation to prove the strong normalizability.