A confluent lambda-calculus with a catch/throw mechanism - Archive ouverte HAL Access content directly
Journal Articles Journal of Functional Programming Year : 1999

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.
No file

Dates and versions

hal-00094601 , version 1 (14-09-2006)

Identifiers

  • HAL Id : hal-00094601 , version 1

Cite

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

Collections

CNRS LACL UPEC
77 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More