See this document in CiteSeerX!

Gentzen-style classical logic as CPS calculus  (Make Corrections)  
Ichiro Ogata Electrotechnical Laboratory 1-1-4 Umezono Tsukuba 305-8568 JAPAN ...



  Home/Search   Context   Related

 
View or download:
etl.go.jp/etl/etlclu/~o...ijfcs99.ps.gz
etl.go.jp/~ogata/Drafts...ijfcs99.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  etl.go.jp/etl/etlclu/~ogata/ (more)
From:  etl.go.jp/~ogata/
Homepages:  I.Ogata  

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

Abstract: We show that one can encode proof of the Gentzen's LK as the -terms; and the cut-elimination procedure for LK as fi-contraction. Precisely, we observe that Strongly Normalizable(SN) and Church-Rosser(CR) cut-elimination procedure for (intuitionistic decoration of) LKQ, as presented in Danos et al.(1993), can be considered as the call-by-value(CBV) Continuation Passing Style(CPS) computation. 1 Introduction In this paper we limit ourselves to an explanation of the LKQ, which we claim this... (Update)

Similar documents (at the sentence level):   More
27.9%:   Constructive Classical Logic as CPS-calculus - Ogata (1999)   (Correct)
23.2%:   Gentzen-Style Classical Proofs asλμ-Terms - Ogata (1999)   (Correct)
20.0%:   Gentzen-Style Classical Proofs as λμ-Terms - Ogata (1999)   (Correct)

Active bibliography (related documents):   More   All
0.7:   Classical Proofs as Programs, Cut Elimination as Computation - Ogata   (Correct)
0.4:   A proof theoretical approach to Continuation Passing Style - Ichiro Ogata   (Correct)
0.3:   A Proof Theoretical Account of Continuation Passing Style - Ogata   (Correct)

Similar documents based on text:   More   All
1.1:   Call-by-Value λμ-calculus and Its Simulation by the.. - Ogata   (Correct)

BibTeX entry:   (Update)

@misc{ ogata-gentzenstyle,
  author = "Ichiro Ogata",
  title = "Gentzen-style classical logic as CPS calculus",
  url = "citeseer.ist.psu.edu/34496.html" }
Citations (may not include all citations):
215   Theoretical Computer Science (context) - Girard - 1987
110   A formulae-as-types notion of control - Griffin - 1990
71   Lambda calculus schemata - Fischer - 1972
58   Untersuchungen uber das logische schließen (context) - Gentzen - 1935
57   A new deconstructive logic: linear logic - Danos, Joinet et al. - 1997
53   Center for the Study of Language and Information (context) - Troelstra, Linear et al. - 1992
32   Classical proofs as programs (context) - Parigot - 1993
32   Normalization as a homomorphic image of cut-elimination (context) - Pottinger - 1977
32   Correspondence between cut-elimination and normalization (context) - Zucker - 1974
28   and Jean-Jacques L'evy (context) - Abadi, Cardelli et al. - 1990
24   A computational analysis of Girard's translation and LC (context) - Murthy - 1992
24   Normal forms for sequent derivations (context) - Mints - 1996
21   A new constructive logic: Classical logic (context) - Girard - 1991
20   Annals of Pure and Applied Logic (context) - Girard, unity - 1993
17   Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1988
16   A cps-translation of the ¯-calculus (context) - de Groote - 1994
12   La Logique Lin'eaire Appliqu'ee `a l (context) - Danos - 1990
9   calculus structure ismorphic to gentzen-style sequent calcul.. (context) - Herbelin - 1994
7   Continuation models are universal for ¯-calculus (context) - Hofmann, Streicher - 1997
5   a Poof-Theoretical Study (context) - Prawitz - 1965

Documents on the same site (http://www.etl.go.jp/etl/etlclu/~ogata/):   More
Gentzen-Style Classical Proofs as λμ-Terms - Ogata (1999)   (Correct)
A proof theoretical approach to Continuation Passing Style - Ichiro Ogata   (Correct)
Classical Proofs as Programs, Cut Elimination as Computation - Ogata   (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