This paper gives a new proof for the approximation theorem and the characterisation of normalisability using intersection types. The technique applied is to define reduction on derivations and to show a strong normalisation result for this reduction. From this result, the characterisation of strong normalisation and the approximation result will follow easily; the latter, in its turn, will lead to the characterisation of (head-)normalisability
AbstractWe characterize β-strongly normalizing λ-terms by means of a non-idempotent intersection typ...
AbstractWe show how to characterise compositionally a number of evaluation properties of λ-terms usi...
This paper gives a characterisation, via intersection types, of the strongly normalising proof-terms...
This paper gives a new proof for the approximation theorem and the characterisation of normalisabili...
AbstractThis paper gives a new proof for the approximation theorem and the characterisation of norma...
AbstractThis paper defines reduction on derivations in the strict intersection type assignment syste...
We show characterisation results for normalisation, head-normalisation, and strong normalisation for...
We study the strict type assignment for λμ that is presented in [7]. We define a notion of approxima...
This paper defines reduction on derivations in the strict intersection type assignment system of [1]...
This paper defines reduction on derivations in the strict intersection type assignment system of [2]...
We provide a new and elementary proof of strong normalization for the lambda calculus of intersectio...
One of the basic principles in typed lambda calculi is that typable lambda terms are normalizable. ...
AbstractWe introduce a new unification procedure for the type inference problem in the intersection ...
We present a typing system with non-idempotent intersection types, typing aterm syntax covering thre...
AbstractA general reducibility method is developed for proving reduction properties of lambda terms ...
AbstractWe characterize β-strongly normalizing λ-terms by means of a non-idempotent intersection typ...
AbstractWe show how to characterise compositionally a number of evaluation properties of λ-terms usi...
This paper gives a characterisation, via intersection types, of the strongly normalising proof-terms...
This paper gives a new proof for the approximation theorem and the characterisation of normalisabili...
AbstractThis paper gives a new proof for the approximation theorem and the characterisation of norma...
AbstractThis paper defines reduction on derivations in the strict intersection type assignment syste...
We show characterisation results for normalisation, head-normalisation, and strong normalisation for...
We study the strict type assignment for λμ that is presented in [7]. We define a notion of approxima...
This paper defines reduction on derivations in the strict intersection type assignment system of [1]...
This paper defines reduction on derivations in the strict intersection type assignment system of [2]...
We provide a new and elementary proof of strong normalization for the lambda calculus of intersectio...
One of the basic principles in typed lambda calculi is that typable lambda terms are normalizable. ...
AbstractWe introduce a new unification procedure for the type inference problem in the intersection ...
We present a typing system with non-idempotent intersection types, typing aterm syntax covering thre...
AbstractA general reducibility method is developed for proving reduction properties of lambda terms ...
AbstractWe characterize β-strongly normalizing λ-terms by means of a non-idempotent intersection typ...
AbstractWe show how to characterise compositionally a number of evaluation properties of λ-terms usi...
This paper gives a characterisation, via intersection types, of the strongly normalising proof-terms...