Abstract
We derive a confluent λ-calculus with a catch/throw mechanism (called λct-calculus) from
Parigot's λμ-calculus. We also present several translations from one calculus into the other
which are morphisms for the reduction. We use them to show that the λct-calculus is a
retract of λμ-calculus (these calculi are isomorphic if we consider only convertibility). As a
by-product, we obtain the subject reduction property for the λct-calculus, as well as the strong
normalization for λct-terms typable in the second order classical natural deduction.
Publisher
Cambridge University Press (CUP)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Exception Handling and Classical Logic;Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages 2019;2019-10-07
2. Realizability Interpretation and Normalization of Typed Call-by-Need $$\lambda $$-calculus with Control;Lecture Notes in Computer Science;2018
3. A verified abstract machine for functional coroutines;Electronic Proceedings in Theoretical Computer Science;2016-06-19
4. TheλμT-calculus;Annals of Pure and Applied Logic;2013-06
5. Unifying Classical and Intuitionistic Logics for Computational Control;2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science;2013-06