See this document in CiteSeerX!

Extracting Constructive Content from Classical Logic via Control-like Reductions  (Make Corrections)  (14 citations)
Franco Barbanera, Stefano Berardi
Proceedings 1st Intl.\ Conf.\ on Typed Lambda Calculi and Applications, TLCA'93, Utrecht, The Netherlands, 16--18 March 1993



  Home/Search   Context   Related

 
View or download:
lambda.di.unito.it...eContentFrom.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  di.unito.it/~stefano/Research.... (more)
Homepages:  S.Berardi  

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

Abstract: . Recently there has been much interest in the problem of finding the computational content of classical reasoning. One of the most appealing directions for the computer scientist to tackle such a problem is the relation which has been established between classical logic and lambda calculi with control operators, like Felleisen's control operator C. In this paper we introduce a typed lambda calculus with the C operator corresponding to Peano Arithmetic, and a set of reduction rules related to... (Update)

Context of citations to this paper:   More

.... This initiated quite a bit of work aimed at extending the Curry Howard correspondence to classical logic, e.g. by Barbanera and Berardi [1], Constable and Murthy [5] Krivine [14] and Parigot [17] We now describe in more detail what the paper is about. In section 2 we fix our...

...as types paradigm to classical logic has been widely investigated by T. G. Griffin [10] C. R. Murthy [14] F. Barbanera and S. Berardi [1], N. J. Rehof and M. H. Srensen [23] P. De Groote [6] J. L. Krivine [13] and M. Parigot [18, 19] H. Nakano, Y. Kameyama and M....

Cited by:   More
Program Extraction from Proofs - Schwichtenberg (2002)   (Correct)
Minimal Classical Logic and Control Operators - Ariola, Herbelin (2003)   (Correct)
A Constructive Restriction of the lambda µ-calculus - Crolard (1999)   (Correct)

Active bibliography (related documents):   More   All
0.6:   A Strong Normalization Result for Classical Logic - Barbanera, Berardi (1995)   (Correct)
0.3:   CPS Translations and Applications: The Cube and Beyond - Barthe, Hatcliff, Sørensen (1996)   (Correct)
0.3:   A Constructive Valuation Semantics for Classical Logic - Barbanera, Berardi   (Correct)

System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text:   More   All
0.3:   Order-types of models of Peano arithmetic: a short survey - Bovykin, Kaye (2001)   (Correct)
0.3:   "Classical" programming-with-proofs in.. - Franco Barbanera, ..   (Correct)
0.3:   The Simply-Typed Theory of β-conversion has no maximum.. - Barbanera, Berardi   (Correct)

Related documents from co-citation:   More   All
11:   calculus: an algorithmic interpretation of classical natural deduction (context) - Parigot - 1992
10:   A formulae-as-types notion of control - Griffin - 1990
7:   An evaluation semantics for classical proofs (context) - Murthy - 1991

BibTeX entry:   (Update)

F. Barbanera and S. Berardi. Extracting constructive content from classical proofs via control-like reductions. In Bezem and Groote [12]. http://citeseer.ist.psu.edu/31939.html   More

@incollection{ barbanera93extracting,
    author = "Franco Barbanera and Stefano Berardi",
    title = "Extracting Constructive Content from Classical Logic via Control-Like Reductions",
    booktitle = "Proceedings 1st Intl.\ Conf.\ on Typed Lambda Calculi and Applications, {TLCA}'93, Utrecht, The Netherlands, 16--18 March 1993",
    volume = "664",
    publisher = "Springer-Verlag",
    address = "Berlin",
    editor = "M. Bezem and J. F. Groote",
    pages = "45--59",
    year = "1993",
    url = "citeseer.ist.psu.edu/31939.html" }
Citations (may not include all citations):
138   The revised report on the syntactic theories of sequential c.. - Felleisen, Hieb - 1989
72   A new constructive logic : Classical Logic (context) - Girard - 1990
60   Extracting constructive content from classical proofs (context) - Murthy - 1990
34   Classically and intuitionistically provably recursive functi.. (context) - Friedman - 1978
34   Reasoning with continuations (context) - Felleisen, Friedman et al. - 1986
18   lambda-mu-calculus: an algorithmic interpretation of classic.. (context) - Parigot
11   A formulas-as-types notion of control (context) - Griffin - 1990
10   Mathematical significance of consistency proofs (context) - Kreisel - 1958
9   Continuations and simple types: a strong normalization resul.. (context) - Barbanera, Berardi - 1992
4   A constructive valuation interpretation for classical logic .. (context) - Barbanera, Berardi - 1992
2   Validity and normalizability of proofs in 1-st and 2-nd orde.. (context) - Prawitz - 1981
1   A Game-theoric semantic of Classical Logic (context) - Coquand - 1992



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.di.unito.it/~stefano/Research.html/):   More
βη-complete models for system F - Berardi, Berline (1998)   (Correct)
A Strong Normalization Result for Classical Logic - Barbanera, Berardi (1995)   (Correct)
The Simply-Typed Theory of β-conversion has no maximum.. - Barbanera, Berardi   (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