A short proof of the strong normalization of the simply typed $\lambda \mu$-calculus

Abstract

We give an elementary and purely arithmetical proof of the strong normalization of Parigot's simply typed $\lambda \mu$-calculus.

Cited by in corpus (1)

• Why the usual candidates of reducibility do not work for the symmetric $\lambda \mu$-calculus