AbstractWe characterize β-strongly normalizing λ-terms by means of a non-idempotent intersection type system. More precisely, we first define a memory calculus K together with a non-idempotent intersection type system K, and we show that a K-term t is typable in K if and only if t is K-strongly normalizing. We then show that β-strong normalization is equivalent to K-strong normalization. We conclude since λ-terms are strictly included in K-terms
Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether ...
This paper gives a characterisation, via intersection types, of the strongly normalising terms of an...
We study the strict type assignment for λμ that is presented in [7]. We define a notion of approxima...
We present a typing system with non-idempotent intersection types, typing a term syntax covering thr...
International audienceWe present a typing system for the λ-calculus, with non-idempotent intersectio...
We show characterisation results for normalisation, head-normalisation, and strong normalisation for...
We define two resource aware typing systems for the lambda-mu-calculus based on non-idempotent inter...
This paper gives a characterisation, via intersection types, of the strongly normalising proof-terms...
AbstractThis paper defines reduction on derivations in the strict intersection type assignment syste...
AbstractThis paper gives a new proof for the approximation theorem and the characterisation of norma...
We provide a new and elementary proof of strong normalization for the lambda calculus of intersectio...
We give a proof that all terms that type-check in the theory of contructions are strongly normalizin...
We study systems of non-idempotent intersection types for different variants of the lambda-calculus ...
This paper gives a new proof for the approximation theorem and the characterisation of normalisabili...
International audiencePure Pattern Type Systems (P 2 T S ) combine in a unified setting the framewor...
Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether ...
This paper gives a characterisation, via intersection types, of the strongly normalising terms of an...
We study the strict type assignment for λμ that is presented in [7]. We define a notion of approxima...
We present a typing system with non-idempotent intersection types, typing a term syntax covering thr...
International audienceWe present a typing system for the λ-calculus, with non-idempotent intersectio...
We show characterisation results for normalisation, head-normalisation, and strong normalisation for...
We define two resource aware typing systems for the lambda-mu-calculus based on non-idempotent inter...
This paper gives a characterisation, via intersection types, of the strongly normalising proof-terms...
AbstractThis paper defines reduction on derivations in the strict intersection type assignment syste...
AbstractThis paper gives a new proof for the approximation theorem and the characterisation of norma...
We provide a new and elementary proof of strong normalization for the lambda calculus of intersectio...
We give a proof that all terms that type-check in the theory of contructions are strongly normalizin...
We study systems of non-idempotent intersection types for different variants of the lambda-calculus ...
This paper gives a new proof for the approximation theorem and the characterisation of normalisabili...
International audiencePure Pattern Type Systems (P 2 T S ) combine in a unified setting the framewor...
Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether ...
This paper gives a characterisation, via intersection types, of the strongly normalising terms of an...
We study the strict type assignment for λμ that is presented in [7]. We define a notion of approxima...