AbstractBy a detailed analysis of the interaction between β-reduction →β and η-expansion →η̄ in the simply typed λ-calculus, a modular and purely syntactic proof method is devised in order to derive strong normalization of the combined reduction →βη̄ from that of →β and →η̄. It is shown how this technique extends to β-normalizing functional Pure Type Systems with Barthe’s formulation of η-expansion
Pure type systems are an elegant formalism allowing to specify in a very easy way a large number of ...
AbstractFor some typedλ-calculi it is easier to prove weak normalization than strong normalization. ...
AbstractWe introduce a typed π-calculus where strong normalisation is ensured by typability. Strong ...
AbstractBy a detailed analysis of the interaction between β-reduction →β and η-expansion →η̄ in the ...
Abstract. This paper presents simple, syntactic strong normalization proofs for the simply-typed λ-c...
Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether ...
Traditionally, decidability of conversion for typed λ-calculi is established by showing that small-s...
AbstractTait's proof of strong normalization for the simply typed λ-calculus is interpreted in a gen...
Abstract. It is shown how the sequent calculus LJ can be embedded into a simple extension of the λ-c...
Abstract. We present a uniform framework for defining different λ-typed λ-calculi in terms of system...
Abstract. We present a formal treatment of normalization by evalua-tion in type theory. The involved...
(eng) Pure type systems are an elegant formalism allowing to specify in a very easy way a large numb...
Extending the λ-calculus with either explicit substitution or generalised reduction has been the sub...
AbstractThis paper describes the simply typed 2λ-calculus, a language with three levels: types, term...
The use of expansionary j-rewrite rules in various typed -calculi has become increasingly common in ...
Pure type systems are an elegant formalism allowing to specify in a very easy way a large number of ...
AbstractFor some typedλ-calculi it is easier to prove weak normalization than strong normalization. ...
AbstractWe introduce a typed π-calculus where strong normalisation is ensured by typability. Strong ...
AbstractBy a detailed analysis of the interaction between β-reduction →β and η-expansion →η̄ in the ...
Abstract. This paper presents simple, syntactic strong normalization proofs for the simply-typed λ-c...
Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether ...
Traditionally, decidability of conversion for typed λ-calculi is established by showing that small-s...
AbstractTait's proof of strong normalization for the simply typed λ-calculus is interpreted in a gen...
Abstract. It is shown how the sequent calculus LJ can be embedded into a simple extension of the λ-c...
Abstract. We present a uniform framework for defining different λ-typed λ-calculi in terms of system...
Abstract. We present a formal treatment of normalization by evalua-tion in type theory. The involved...
(eng) Pure type systems are an elegant formalism allowing to specify in a very easy way a large numb...
Extending the λ-calculus with either explicit substitution or generalised reduction has been the sub...
AbstractThis paper describes the simply typed 2λ-calculus, a language with three levels: types, term...
The use of expansionary j-rewrite rules in various typed -calculi has become increasingly common in ...
Pure type systems are an elegant formalism allowing to specify in a very easy way a large number of ...
AbstractFor some typedλ-calculi it is easier to prove weak normalization than strong normalization. ...
AbstractWe introduce a typed π-calculus where strong normalisation is ensured by typability. Strong ...
DOI
Add to ORKG