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

zbMath1272.68082arXiv0905.1554MaRDI QIDQ2851698

René David, Karim Nour

Publication date: 2 October 2013

Full work available at URL: https://arxiv.org/abs/0905.1554

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items

Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage ⋮ Classical \(F_{\omega}\), orthogonality and symmetric candidates ⋮ An estimation for the lengths of reduction sequences of the $\lambda\mu\rho\theta$-calculus ⋮ Abstracting models of strong normalization for classical calculi