Abstract: "With the help of continuations, we first construct a transformation T which transforms every [lambda]-term t into a [lambda]I-term T(t). Then we apply the conservation theorem in [lambda]-calculus to show that t is strongly normalisable if T(t) has a ╬▓-normal form. In this way, we succeed in establishing the equivalence between weak and strong normalisation theorems in various typed [lambda]-calculi. This not only enhances the understanding between weak and strong normalisations, but also presents an elegant approach to proving strong normalisation theorems via the notion of weak normalisations.
International audienceThe symmetric $\lambda \mu$-calculus is the $\lambda \mu$-calculus introduced ...
Abstract. We identify a restricted class of terms of the lambda calculus, here called weak linear, t...
In this paper we give an arithmetical proof of the strong normalization oflambda-Sym-Prop of Berardi...
An auxiliary notion of reduction ρ on the λ-terms preserves strong normalisation if all strongly no...
We present a somewhat general technique to derive the strong normalisation of some specific terms of...
Abstract. This paper describes a method of proving strong normalization based on an extension of the...
International audienceThe lambda_ws-calculus is a lambda-calculus with explicit substitutions that s...
AbstractFor some typedλ-calculi it is easier to prove weak normalization than strong normalization. ...
This paper is part of a general programme of treating explicit substitutions as the primary $\lambda...
AbstractWe identify a restricted class of terms of the lambda calculus, here called weak linear, tha...
. This paper is part of a general programme of treating explicit substitutions as the primary -calcu...
International audienceWe give an elementary and purely arithmetical proof of the strong normalizatio...
In this paper we give an arithmetical proof of the strong normalization of λ Sym Prop of Berardi and...
AbstractWe introduce a typed π-calculus where strong normalisation is ensured by typability. Strong ...
Abstract. In a previous paper [4], we introduced a non-deterministic λ-calculus (λ-LK) whose type sy...
International audienceThe symmetric $\lambda \mu$-calculus is the $\lambda \mu$-calculus introduced ...
Abstract. We identify a restricted class of terms of the lambda calculus, here called weak linear, t...
In this paper we give an arithmetical proof of the strong normalization oflambda-Sym-Prop of Berardi...
An auxiliary notion of reduction ρ on the λ-terms preserves strong normalisation if all strongly no...
We present a somewhat general technique to derive the strong normalisation of some specific terms of...
Abstract. This paper describes a method of proving strong normalization based on an extension of the...
International audienceThe lambda_ws-calculus is a lambda-calculus with explicit substitutions that s...
AbstractFor some typedλ-calculi it is easier to prove weak normalization than strong normalization. ...
This paper is part of a general programme of treating explicit substitutions as the primary $\lambda...
AbstractWe identify a restricted class of terms of the lambda calculus, here called weak linear, tha...
. This paper is part of a general programme of treating explicit substitutions as the primary -calcu...
International audienceWe give an elementary and purely arithmetical proof of the strong normalizatio...
In this paper we give an arithmetical proof of the strong normalization of λ Sym Prop of Berardi and...
AbstractWe introduce a typed π-calculus where strong normalisation is ensured by typability. Strong ...
Abstract. In a previous paper [4], we introduced a non-deterministic λ-calculus (λ-LK) whose type sy...
International audienceThe symmetric $\lambda \mu$-calculus is the $\lambda \mu$-calculus introduced ...
Abstract. We identify a restricted class of terms of the lambda calculus, here called weak linear, t...
In this paper we give an arithmetical proof of the strong normalization oflambda-Sym-Prop of Berardi...