See this document in CiteSeerX!

A Constructive Restriction of the lambda µ-calculus (1999)  (Make Corrections)  
Tristan Crolard



  Home/Search   Context   Related

 
View or download:
univparis12.fr/lacl/cro...conslm.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  univparis12.fr/lacl/crolard/p... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We define a very natural restriction of the -calculus which is stable under reduction and whose type system is a restriction of the Classical Natural Deduction to intuitionistic logic. However, we show that this system is in some sense degenerated unless we provide a native disjunction. We prove that the system with native disjunction is conservative over DIS-logic and also that DIS-logic is constructive. From a computational standpoint, this restriction on -terms prevents a coroutine from... (Update)

Active bibliography (related documents):   More   All
1.3:   A Confluent Lambda-Calculus With a Catch/throw Mechanism - Crolard   (Correct)
1.1:   Subtractive Logic - Crolard (1999)   (Correct)
0.6:   Strong Normalizability of the Non-deterministic Catch/Throw.. - Kameyama, Sato   (Correct)

Similar documents based on text:   More   All
0.8:   A Portable C++ Library for Coroutine Sequencing - Helsgaun   (Correct)
0.2:   Coroutine Synchronization In Avs - Klinker (1994)   (Correct)
0.1:   Understanding Control Flow - With Concurrent Programming using.. - Buhr (1995)   (Correct)

BibTeX entry:   (Update)

@unpublished{ crolard99constructive,
    author = "Tristan Crolard",
    title = "A Constructive Restriction of the {$\lambda\mu$}-Calculus",
    year = "1999",
    url = "citeseer.ist.psu.edu/crolard99constructive.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
60   Contraction-free sequent calculi for intuitionistic logic (context) - Dyckhoff - 1992
57   Continuation-based multiprocessing - Wand - 1980
55   Adding threads to standard ML - Cooper, Morrisett - 1990
32   Classical proofs as programs (context) - Parigot - 1993
23   Mathematical intuitionism--introduction to proof theory (context) - Dragalin - 1988
14   Intuitionistic and classical natural deduction systems with .. - Sato - 1997
14   Department of Computer Science (context) - Ramsey, in et al. - 1990
14   Extracting constructive content from classical logic via con.. - Barbanera, Berardi - 1994
13   A constructive logic behind the catch and throw mechanism (context) - Nakano - 1994
11   Delta -calculus - Rehof, Srensen - 1994
9   The Logical Structures of the Catch and Throw Mechanism - Nakano - 1995
9   Classical proofs as programs: How (context) - Murthy - 1991
8   The non-deterministic catch and throw mechanism and its subj.. - Nakano - 1994
7   A simple calculus of exception handling - de Groote - 1995
6   First-class synchronous operations - Reppy - 1995
5   storage operators and second order -calculus (context) - Krivine - 1994
5   A new formulation of the catch/throw mechanism - Kameyama - 1997
4   An algebraic and Kripke-style approach to a certain extensio.. (context) - Rauszer - 1980
3   ese de Doctorat. Universit (context) - Crolard, de Curry-Howard et al. - 1996
2   From bicartesian closed categories with coexponents towards .. (context) - Crolard
2   Gentzen Collected work (context) - Szabo - 1969
1   Asynchronous signals is standard ML (context) - Reppy - 1990
1   A confluent lambda-calculus with a catch/throw mechanism (context) - Crolard
1   Continuations and coroutines: An exercise in metaprogramming (context) - Friedman, Haynes et al. - 1984
1   throw calculus with tag abstraction and its strong normaliza.. (context) - Kameyama, Sato et al. - 1998
1   Strong normalisation for second order classical natural dedu.. (context) - Parigot - 1993

Documents on the same site (http://www.univ-paris12.fr/lacl/crolard/publications/):
Subtractive Logic - Crolard (1999)   (Correct)
A Confluent Lambda-Calculus With a Catch/throw Mechanism - Crolard   (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