(Enter summary)
Abstract: We derive a confluent -calculus with a catch/throw mechanism (called ct -calculus) from
M. 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 ... (Update)
Active bibliography (related documents): More All
1.3: A Constructive Restriction of the lambda µ-calculus - Crolard (1999)
(Correct)
0.8: Strong Normalizability of the Non-deterministic Catch/Throw.. - Kameyama, Sato
(Correct)
0.5: Constraint Programming and Operations Research - McAloon, Tretkoff
(Correct)
Similar documents based on text: More All
1.1: A Constructive Formalization of the Catch and Throw Mechanism - Nakano (1992)
(Correct)
1.1: The Non-deterministic Catch and Throw Mechanism and Its Subject.. - Nakano (1994)
(Correct)
0.6: A Predicate Logic Framework for Mechanical.. - Danièle.. (2000)
(Correct)
BibTeX entry: (Update)
@article{ crolard99confluent,
author = "Tristan Crolard",
title = "A confluent lambda-calculus with a catch/throw mechanism",
journal = "Journal of Functional Programming",
volume = "9",
number = "6",
pages = "625-647",
year = "1999",
url = "citeseer.ist.psu.edu/396022.html" }
Citations (may not include all citations):
134
calculus: an algorithmic interpretation of classical natural.. (context) - Parigot - 1992
110
A formulae-as-type notion of control
- Griffin - 1990
75
A syntactic theory of sequential control (context) - Felleisen, Friedman et al. - 1987
60
Extracting constructive content from classical proofs (context) - Murthy - 1990
40
A Curry-Howard foundation for functional computation with co..
- Ong, Stewart - 1997
34
Reasoning with continuations (context) - Felleisen, Friedman et al. - 1986
24
A semantic view of classical proofs: Type-theoretic (context) - Ong - 1996
14
Intuitionistic and classical natural deduction systems with ..
- Sato - 1997
14
Extracting constructive content from classical logic via con..
- Barbanera, Berardi
13
A constructive logic behind the catch and throw mechanism (context) - Nakano
9
Classical proofs as programs: How (context) - Murthy - 1991
9
The discoveries of continuations
- Reynolds - 1993
8
The non-deterministic catch and throw mechanism and its subj..
- Nakano
7
A simple calculus of exception handling
- Groote - 1995
5
A new formulation of the catch/throw mechanism
- Kameyama - 1997
3
A classical catch/throw calculus with tag abstraction and it..
- Kameyama, Sato - 1998
2
ese de Doctorat. Universit (context) - Py - 1998
2
From bicartesian closed categories with coexponents towards .. (context) - Crolard - 1999
2
Classical logic (context) - Krivine - 1994
1
Pages 495--515 of: Theoretical aspects of computer software (context) - Barbanera, Berardi
1
Classical logic (context) - Beus, Streicher - 1998
1
The logical structures of the catch and throw mechanism (context) - Nakano - 1995
1
Pages 516--542 of: Theoritical aspects of computer software (context) - Rehof, Srensen - 1994
1
Classical proofs as programs (context) - --, Proc et al. - 1993
1
ese de Doctorat. Universit (context) - confluent, with et al. - 1996
Documents on the same site (http://www.univ-paris12.fr/lacl/crolard/publications/):
Subtractive Logic - Crolard (1999)
(Correct)
A Constructive Restriction of the lambda µ-calculus - Crolard (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC