AbstractIn this paper we give a strong normalization proof for a set of reduction rules for classical logic. These reductions, more general than the ones usually considered in literature, are inspired to the reductions of Felleisen's lambda calculus with continuations
Abstract. In a previous paper [4], we introduced a non-deterministic λ-calculus (λ-LK) whose type sy...
Submitted to APALWe prove the strong normalization of full classical natural deduction (i.e. with co...
International audienceWe give an elementary and purely arithmetical proof of the strong normalizatio...
In this paper we give a strong normalization proof for a set of reduction rules for classical logic....
AbstractIn this paper we give a strong normalization proof for a set of reduction rules for classica...
An auxiliary notion of reduction ρ on the λ-terms preserves strong normalisation if all strongly no...
Abstract. In this paper we present a strongly normalising cut-elimination procedure for classical lo...
International audienceWe give arithmetical proofs of the strong normalization of two symmetric $\lam...
In this paper we give an arithmetical proof of the strong normalization oflambda-Sym-Prop of Berardi...
The main objective of this PhD Thesis is to present a method of obtaining strong normalization via n...
In this paper we give an arithmetical proof of the strong normalization of λ Sym Prop of Berardi and...
We extend Barbanera and Berardi's symmetric lambda calculus [2] to second order classical propo...
We introduce a call-by-name lambda-calculus $\lambda J$ with generalized applications which integrat...
International audienceThe symmetric $\lambda \mu$-calculus is the $\lambda \mu$-calculus introduced ...
Abstract. In this paper a strongly normalising cut-elimination procedure is presented for classical ...
Abstract. In a previous paper [4], we introduced a non-deterministic λ-calculus (λ-LK) whose type sy...
Submitted to APALWe prove the strong normalization of full classical natural deduction (i.e. with co...
International audienceWe give an elementary and purely arithmetical proof of the strong normalizatio...
In this paper we give a strong normalization proof for a set of reduction rules for classical logic....
AbstractIn this paper we give a strong normalization proof for a set of reduction rules for classica...
An auxiliary notion of reduction ρ on the λ-terms preserves strong normalisation if all strongly no...
Abstract. In this paper we present a strongly normalising cut-elimination procedure for classical lo...
International audienceWe give arithmetical proofs of the strong normalization of two symmetric $\lam...
In this paper we give an arithmetical proof of the strong normalization oflambda-Sym-Prop of Berardi...
The main objective of this PhD Thesis is to present a method of obtaining strong normalization via n...
In this paper we give an arithmetical proof of the strong normalization of λ Sym Prop of Berardi and...
We extend Barbanera and Berardi's symmetric lambda calculus [2] to second order classical propo...
We introduce a call-by-name lambda-calculus $\lambda J$ with generalized applications which integrat...
International audienceThe symmetric $\lambda \mu$-calculus is the $\lambda \mu$-calculus introduced ...
Abstract. In this paper a strongly normalising cut-elimination procedure is presented for classical ...
Abstract. In a previous paper [4], we introduced a non-deterministic λ-calculus (λ-LK) whose type sy...
Submitted to APALWe prove the strong normalization of full classical natural deduction (i.e. with co...
International audienceWe give an elementary and purely arithmetical proof of the strong normalizatio...
DOI
Add to ORKG