Constructive Classical Logic as CPS-Calculus

@article{Ogata2000ConstructiveCL,
  title={Constructive Classical Logic as CPS-Calculus},
  author={Ichiro Ogata},
  journal={Int. J. Found. Comput. Sci.},
  year={2000},
  volume={11},
  pages={89-112}
}
  • Ichiro Ogata
  • Published 1 March 2000
  • Mathematics
  • Int. J. Found. Comput. Sci.
We establish the Curry-Howard isomorphism between constructive classical logic and -calculus. -calculus exactly means the target language of Continuation Passing Style (CPS) transforms. Constructive classical logic we refer to are LKT and LKQ introduced by Danos et al.(1993). 

Figures and Tables from this paper

CPS-calculus in Various Style
TLDR
It is emphasized that CPS translates calculus with control operators into a very basic calculus | CPS calculus, which is Curry-Howard isomorphic to classical logic LKT.
A CPS-Transform of Constructive Classical Logic
TLDR
It is shown that the cut-elimination for LKT, as presented in Danos et al.(1993), simulates the normalization for classical natural deduction (CND), and can be considered as a classical extension to call-byname (CBN) CPS-transform.
Call-By-Value λ μ-calculus and Its Simulation by the Cut-Elimination Procedure for LKQ
We show Call-By-Value(CBV) normalization for CND (Parigot 92) can be simulated by by cut-elimination for LKQ (Danos-JoinetSchellinx 93), namely q-protocol. For this, a new term calculus was made for
A Proof Theoretical Account of Continuation Passing Style
TLDR
The CBV normalization for CND can be simulated by the cut-elimination procedure for LKQ (Danos-Joinet-Schellinx 93), namely the q-protocol, and a proof-term assignment system is used to prove this fact.
Correspondence between Normalization of CND and Cut-Elimination of LKT
TLDR
It is argued that the translation from CND to LKT can be considered as a general form of call-by-name CPS-translation and the simulation theorem is shown; the normalization of CND can be simulated by cut-elimination of LKT.
The duality of computation
TLDR
The μ -calculus is presented, a syntax for λ-calculus + control operators exhibiting symmetries such as program/context and call-by-name/call- by-value, derived from implicational Gentzen's sequent calculus LK.
The logical basis of evaluation order and pattern-matching
TLDR
This thesis aims to give a fresh take on the proofs-as-programs analogy, and obtains a programming language with built-in support for pattern-matching, in which evaluation order is explicitly reflected at the level of types—and hence can be controlled locally, rather than being an ad hoc, global policy decision.

References

SHOWING 1-10 OF 42 REFERENCES
Explicit substitutions
The λ&sgr;-calculus is a refinement of the λ-calculus where substitutions are manipulated explicitly. The λ&sgr;-calculus provides a setting for studying the theory of substitutions, with pleasant
Continuation Models Are Universal for -calculus
We show that a certain simple call-by-name continuation semantics of Parigot's-calculus is complete. More precisely, for every-theory we construct a cartesian closed category such that the ensuing
A computational analysis of Girard's translation and LC
  • Chetan R. Murthy
  • Computer Science
    [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science
  • 1992
TLDR
An intuitionistic term-extraction procedure is provided for Girard's new classical logic LC, and using the syntactic properties of this language, it is possible to give simple proofs for the evidence properties of LC.
Categorical Structure of Continuation Passing Style
This thesis attempts to make precise the structure inherent in Continuation Passing Style (CPS). We emphasize that CPS translates λ-calculus into a very basic calculus that does not have functions as
Continuation models are universal for lambda-mu-calculus
We show that a certain simple call-by-name continuation semantics of Parigot's lambda-mu-calculus is complete. More precisely, for every lambda-mu-theory we construct a cartesian closed category such
A formulae-as-type notion of control
TLDR
It is proved that all evaluations of typed terms in Idealized Scheme are finite, and the existence of computationally interesting “classical programs” is illustrated by the definition of conjunctively, disjunctive, and existential types using standard classical definitions.
Control categories and duality: on the categorical semantics of the lambda-mu calculus
  • P. Selinger
  • Computer Science
    Mathematical Structures in Computer Science
  • 2001
TLDR
It is proved, via a categorical structure theorem, that the categorical semantics is equivalent to a CPS semantics in the style of Hofmann and Streicher, and that the call-by-name λμ-calculus forms an internal language for the dual co-control categories.
Lambda calculus schemata
A lambda-calculus schema is an expression of the lambda calculus augmented by uninterpreted constant and operator symbols. It is an abstraction of programming languages such as LISP which permit
Lectures on linear logic
1. Introduction 2. Sequent calculus for linear logic 3. Some elementary syntactic results 4. The calculus of two implications: a digression 5. Embeddings and approximations 6. Natural deduction
A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure
TLDR
A λ-calculus for which applicative terms have no longer the form (...((u u1) u2)... un) but the form [u [u1;...;un], for which [u 1;... ;un] is a list of terms is considered.
...
...