International audienceIn the folklore of linear logic, a common intuition is that the structure of finiteness spaces, introduced by Ehrhard, semantically reflects the strong normalization property of cut-elimination. We make this intuition formal in the context of the non-deterministic λ-calculus by introducing a finiteness structure on resource terms, which is such that a λ-term is strongly normalizing iff the support of its Taylor expansion is finitary. An application of our result is the existence of a normal form for the Taylor expansion of any strongly normalizable non-deterministic λ-term
International audienceWe study iteration and recursion operators in the denotational semantics of ty...
We introduce a typed π-calculus where strong normalisation is ensured by typability. Strong normalis...
International audienceU. Berger, significantly simplified Tait's normalisation proof for bar recursi...
International audienceIn the folklore of linear logic, a common intuition is that the structure of f...
International audienceIn our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (w...
Finiteness spaces were introduced by Ehrhard as a refinement of the relational model of linear logic...
AbstractWe characterize β-strongly normalizing λ-terms by means of a non-idempotent intersection typ...
International audienceWe prove the strong normalization of full classical natural deduction (i.e. wi...
International audienceIt has been known since Ehrhard and Regnier's seminal work on the Taylor expan...
International audienceWe present a typing system with non-idempotent intersection types, typing a te...
AbstractWe introduce a typed π-calculus where strong normalisation is ensured by typability. Strong ...
Originating in Girard's Linear logic, Ehrhard and Regnier's Taylor expansion of $\lambda$-terms has ...
The speculative ambition of replacing the old theory of program approximation based on syntactic con...
AbstractA new complete characterization of β-strong normalization is given, both in the classical an...
A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be expanded into a set of resou...
International audienceWe study iteration and recursion operators in the denotational semantics of ty...
We introduce a typed π-calculus where strong normalisation is ensured by typability. Strong normalis...
International audienceU. Berger, significantly simplified Tait's normalisation proof for bar recursi...
International audienceIn the folklore of linear logic, a common intuition is that the structure of f...
International audienceIn our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (w...
Finiteness spaces were introduced by Ehrhard as a refinement of the relational model of linear logic...
AbstractWe characterize β-strongly normalizing λ-terms by means of a non-idempotent intersection typ...
International audienceWe prove the strong normalization of full classical natural deduction (i.e. wi...
International audienceIt has been known since Ehrhard and Regnier's seminal work on the Taylor expan...
International audienceWe present a typing system with non-idempotent intersection types, typing a te...
AbstractWe introduce a typed π-calculus where strong normalisation is ensured by typability. Strong ...
Originating in Girard's Linear logic, Ehrhard and Regnier's Taylor expansion of $\lambda$-terms has ...
The speculative ambition of replacing the old theory of program approximation based on syntactic con...
AbstractA new complete characterization of β-strong normalization is given, both in the classical an...
A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be expanded into a set of resou...
International audienceWe study iteration and recursion operators in the denotational semantics of ty...
We introduce a typed π-calculus where strong normalisation is ensured by typability. Strong normalis...
International audienceU. Berger, significantly simplified Tait's normalisation proof for bar recursi...