AbstractA new complete characterization of β-strong normalization is given, both in the classical and in the lazy λ-calculus, through the notion of potential valuability inside two suitable parametric calculi
Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether ...
AbstractWe present an evaluation technique for proving strong normalization (SN). We use the techniq...
AbstractThis paper proves the confluency and the strong normalizability of the call-by-value λμ-calc...
AbstractA new complete characterization of β-strong normalization is given, both in the classical an...
AbstractA new complete characterization of β-strong normalization is given, both in the classical an...
AbstractFor some typedλ-calculi it is easier to prove weak normalization than strong normalization. ...
We give an elementary and purely arithmetical proof of the strong normalization of Parigot’s simply ...
Abstract: "With the help of continuations, we first construct a transformation T which transforms ev...
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 ...
International audienceWe give an elementary and purely arithmetical proof of the strong normalizatio...
We give a proof for the strong normalization result in the intersection type discipline, which we o...
In this paper we give an arithmetical proof of the strong normalization oflambda-Sym-Prop of Berardi...
. This paper is part of a general programme of treating explicit substitutions as the primary -calcu...
Abstract. This paper describes a method of proving strong normalization based on an extension of the...
Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether ...
AbstractWe present an evaluation technique for proving strong normalization (SN). We use the techniq...
AbstractThis paper proves the confluency and the strong normalizability of the call-by-value λμ-calc...
AbstractA new complete characterization of β-strong normalization is given, both in the classical an...
AbstractA new complete characterization of β-strong normalization is given, both in the classical an...
AbstractFor some typedλ-calculi it is easier to prove weak normalization than strong normalization. ...
We give an elementary and purely arithmetical proof of the strong normalization of Parigot’s simply ...
Abstract: "With the help of continuations, we first construct a transformation T which transforms ev...
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 ...
International audienceWe give an elementary and purely arithmetical proof of the strong normalizatio...
We give a proof for the strong normalization result in the intersection type discipline, which we o...
In this paper we give an arithmetical proof of the strong normalization oflambda-Sym-Prop of Berardi...
. This paper is part of a general programme of treating explicit substitutions as the primary -calcu...
Abstract. This paper describes a method of proving strong normalization based on an extension of the...
Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether ...
AbstractWe present an evaluation technique for proving strong normalization (SN). We use the techniq...
AbstractThis paper proves the confluency and the strong normalizability of the call-by-value λμ-calc...
DOI
Add to ORKG