https://hal.archives-ouvertes.fr/hal-00094601Crolard, TristanTristanCrolardLACL - Laboratoire d'Algorithmique Complexité et Logique - UPEC UP12 - Université Paris-Est Créteil Val-de-Marne - Paris 12 - CNRS - Centre National de la Recherche ScientifiqueA confluent lambda-calculus with a catch/throw mechanismHAL CCSD1999[INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO]Crolard, Tristan2006-09-14 16:54:112021-10-19 16:07:072006-09-14 16:54:11enJournal articles1We 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.