An auxiliary notion of reduction ρ on the λ-terms preserves strong normalisation if all strongly normalising terms for β are also strongly normalising for β∪ρ.Wegive a sufficient condition for ρ to preserve strong normalisation. As an example of application, we check easily the sufficient condition for Regnier’s σ-reduction rules and the ‘‘assoc’’-reduction rule inspired by calculi with let-expressions. This gives the simplest proof so far that the union of all these rules preserves strong normalisation.FC
In this paper we give an arithmetical proof of the strong normalization of λ Sym Prop of Berardi and...
In this paper we give an arithmetical proof of the strong normalization oflambda-Sym-Prop of Berardi...
bloo~win.tue.nl· We introduce a calculus of explicit substitutions and prove that terms that are str...
Abstract: "With the help of continuations, we first construct a transformation T which transforms ev...
We present a somewhat general technique to derive the strong normalisation of some specific terms of...
This paper is part of a general programme of treating explicit substitutions as the primary $\lambda...
We introduce a call-by-name lambda-calculus $\lambda J$ with generalized applications which integrat...
AbstractIn this paper we give a strong normalization proof for a set of reduction rules for classica...
International audienceThe symmetric $\lambda \mu$-calculus is the $\lambda \mu$-calculus introduced ...
International audienceInspired by a recent graphical formalism for lambda-calculus based on linear l...
Explicit substitutions have been introduced as a refinment of the lambda-calculus - the usual formal...
International audienceThe lambda_ws-calculus is a lambda-calculus with explicit substitutions that s...
Abstract. In a previous paper [4], we introduced a non-deterministic λ-calculus (λ-LK) whose type sy...
We introduce a call-by-name lambda-calculus lambdaJ with generalized applications which integrates a...
Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether ...
In this paper we give an arithmetical proof of the strong normalization of λ Sym Prop of Berardi and...
In this paper we give an arithmetical proof of the strong normalization oflambda-Sym-Prop of Berardi...
bloo~win.tue.nl· We introduce a calculus of explicit substitutions and prove that terms that are str...
Abstract: "With the help of continuations, we first construct a transformation T which transforms ev...
We present a somewhat general technique to derive the strong normalisation of some specific terms of...
This paper is part of a general programme of treating explicit substitutions as the primary $\lambda...
We introduce a call-by-name lambda-calculus $\lambda J$ with generalized applications which integrat...
AbstractIn this paper we give a strong normalization proof for a set of reduction rules for classica...
International audienceThe symmetric $\lambda \mu$-calculus is the $\lambda \mu$-calculus introduced ...
International audienceInspired by a recent graphical formalism for lambda-calculus based on linear l...
Explicit substitutions have been introduced as a refinment of the lambda-calculus - the usual formal...
International audienceThe lambda_ws-calculus is a lambda-calculus with explicit substitutions that s...
Abstract. In a previous paper [4], we introduced a non-deterministic λ-calculus (λ-LK) whose type sy...
We introduce a call-by-name lambda-calculus lambdaJ with generalized applications which integrates a...
Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether ...
In this paper we give an arithmetical proof of the strong normalization of λ Sym Prop of Berardi and...
In this paper we give an arithmetical proof of the strong normalization oflambda-Sym-Prop of Berardi...
bloo~win.tue.nl· We introduce a calculus of explicit substitutions and prove that terms that are str...