Add to ORKGAbstract. This paper presents simple, syntactic strong normalization proofs for the simply-typed λ-calculus and the polymorphic λ-calculus (system F) with the full set of logical connectives, and all the permutative reductions. The normalization proofs use translations of terms and types of λ→,∧,∨, ⊥ to terms and types of λ → and from F∀,∃,→,∧,∨, ⊥ to F∀,→.
AbstractWe present an evaluation technique for proving strong normalization (SN). We use the techniq...
AbstractWe present a typed calculus λξ isomorphic to the implicational fragment of the classical seq...
Tait's proof of strong normalization for the simply typed lambda-calculus is interpreted in a genera...
AbstractFor some typedλ-calculi it is easier to prove weak normalization than strong normalization. ...
AbstractTait's proof of strong normalization for the simply typed λ-calculus is interpreted in a gen...
Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether ...
AbstractWe introduce a typed π-calculus where strong normalisation is ensured by typability. Strong ...
We give an elementary and purely arithmetical proof of the strong normalization of Parigot’s simply ...
AbstractBy a detailed analysis of the interaction between β-reduction →β and η-expansion →η̄ in the ...
International audienceWe prove the strong normalization of full classical natural deduction (i.e. wi...
AbstractThis paper proves the confluency and the strong normalizability of the call-by-value λμ-calc...
Abstract. In a previous paper [4], we introduced a non-deterministic λ-calculus (λ-LK) whose type sy...
In this paper we give an arithmetical proof of the strong normalization of λ Sym Prop of Berardi and...
AbstractI give a proof of the confluence of combinatory strong reduction that does not use the one o...
We introduce a typed π-calculus where strong normalisation is ensured by typability. Strong normalis...
AbstractWe present an evaluation technique for proving strong normalization (SN). We use the techniq...
AbstractWe present a typed calculus λξ isomorphic to the implicational fragment of the classical seq...
Tait's proof of strong normalization for the simply typed lambda-calculus is interpreted in a genera...
AbstractFor some typedλ-calculi it is easier to prove weak normalization than strong normalization. ...
AbstractTait's proof of strong normalization for the simply typed λ-calculus is interpreted in a gen...
Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether ...
AbstractWe introduce a typed π-calculus where strong normalisation is ensured by typability. Strong ...
We give an elementary and purely arithmetical proof of the strong normalization of Parigot’s simply ...
AbstractBy a detailed analysis of the interaction between β-reduction →β and η-expansion →η̄ in the ...
International audienceWe prove the strong normalization of full classical natural deduction (i.e. wi...
AbstractThis paper proves the confluency and the strong normalizability of the call-by-value λμ-calc...
Abstract. In a previous paper [4], we introduced a non-deterministic λ-calculus (λ-LK) whose type sy...
In this paper we give an arithmetical proof of the strong normalization of λ Sym Prop of Berardi and...
AbstractI give a proof of the confluence of combinatory strong reduction that does not use the one o...
We introduce a typed π-calculus where strong normalisation is ensured by typability. Strong normalis...
AbstractWe present an evaluation technique for proving strong normalization (SN). We use the techniq...
AbstractWe present a typed calculus λξ isomorphic to the implicational fragment of the classical seq...
Tait's proof of strong normalization for the simply typed lambda-calculus is interpreted in a genera...