Skip to Main content Skip to Navigation
Journal articles

A confluent lambda-calculus with a catch/throw mechanism

Abstract : We derive a confluent lambda-calculus with a catch/throw mechanism (called lambda-ct-calculus) from M. Parigot's lambda-mu-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 lambda-ct-calculus is a retract of lambda-mu-calculus (these calculi are isomorphic if we consider only convertibility). As a by-product, we obtain the subject reduction property for the lambda-ct-calculus, as well as the strong normalization for lambda-ct-terms typable in the second order classical natural deduction.
Document type :
Journal articles
Complete list of metadata
Contributor : Tristan Crolard Connect in order to contact the contributor
Submitted on : Thursday, September 14, 2006 - 4:54:11 PM
Last modification on : Tuesday, October 19, 2021 - 4:07:07 PM


  • HAL Id : hal-00094601, version 1



Tristan Crolard. A confluent lambda-calculus with a catch/throw mechanism. Journal of Functional Programming, Cambridge University Press (CUP), 1999, 9:6, pp.625-647. ⟨hal-00094601⟩



Record views