We show that one can consider the Gentzenstyle classical logic LKT, as presented in Danos et al.(1993), can be considered as the classical call-by-name (CBN) calculus. First, we present a new term calculus for LKT which is isomorphic to cut-elimination procedure (tq-protocol) for LKT. Then, we present a translation of Parigot's λµ-calculus into our term calculus. This translation is essentially identical with so-called Continuation Passing Style. Using this translation, one can show that LKT correctly simulates λµ-calculus. Specifically the Strongly Normalizable(SN) and Church-Rosser(CR) property of λµ-calculus is shown to be a consequence of the SN and CR property of tq-protocol for LKT
We extend Parigot's -calculus to form a system of realizers for classical logic which reflects ...
Remarks by the first author: This four-hand work, praised by a referee as a breakthrough in the prob...
Abstract. In this paper we present a strongly normalising cut-elimination procedure for classical lo...
We show that one can encode proof of the Gentzen's LK as the -terms; and the cut-elimination pr...
We show that the SN and CR cut-elimination procedure on Gentzen-style classical logic LKT/LKQ, as pr...
Gentzen's sequent calculi LK and LJ are landmark proof systems. They identify the structural rules o...
We present the λµµ̃-calculus, a syntax for λ-calculus + con-trol operators exhibiting symmetries suc...
AbstractWe present a typed calculus λξ isomorphic to the implicational fragment of the classical seq...
We present a typed calculus LambdaXi isomorphic to the implicational fragment of the classical seque...
We define an equivalent variant $LK_{sp}$ of the Gentzen sequent calculus $LK$. In $LK_{sp}$ weakeni...
Ariola et al defined a call-by-need λ-calculus with control, together with a sequent calculus presen...
In this thesis we use the syntactic-semantic method of constructive type theory to give meaning to c...
Abstract. In this paper we introduce a cut-elimination procedure for classical logic, which is both ...
An interpretation from LK to NK with one conclusion and full logical sym-bols is defined. Aprocedure...
AbstractA Gentzen-style L-formulation of the calculus of constructions is presented and proved equiv...
We extend Parigot's -calculus to form a system of realizers for classical logic which reflects ...
Remarks by the first author: This four-hand work, praised by a referee as a breakthrough in the prob...
Abstract. In this paper we present a strongly normalising cut-elimination procedure for classical lo...
We show that one can encode proof of the Gentzen's LK as the -terms; and the cut-elimination pr...
We show that the SN and CR cut-elimination procedure on Gentzen-style classical logic LKT/LKQ, as pr...
Gentzen's sequent calculi LK and LJ are landmark proof systems. They identify the structural rules o...
We present the λµµ̃-calculus, a syntax for λ-calculus + con-trol operators exhibiting symmetries suc...
AbstractWe present a typed calculus λξ isomorphic to the implicational fragment of the classical seq...
We present a typed calculus LambdaXi isomorphic to the implicational fragment of the classical seque...
We define an equivalent variant $LK_{sp}$ of the Gentzen sequent calculus $LK$. In $LK_{sp}$ weakeni...
Ariola et al defined a call-by-need λ-calculus with control, together with a sequent calculus presen...
In this thesis we use the syntactic-semantic method of constructive type theory to give meaning to c...
Abstract. In this paper we introduce a cut-elimination procedure for classical logic, which is both ...
An interpretation from LK to NK with one conclusion and full logical sym-bols is defined. Aprocedure...
AbstractA Gentzen-style L-formulation of the calculus of constructions is presented and proved equiv...
We extend Parigot's -calculus to form a system of realizers for classical logic which reflects ...
Remarks by the first author: This four-hand work, praised by a referee as a breakthrough in the prob...
Abstract. In this paper we present a strongly normalising cut-elimination procedure for classical lo...