International audienceWe show that the normal form of the Taylor expansion of a $\lambda$-term is isomorphic to its B\"ohm tree, improving Ehrhard and Regnier's original proof along three independent directions. First, we simplify the final step of the proof by following the left reduction strategy directly in the resource calculus, avoiding to introduce an abstract machine ad hoc. We also introduce a groupoid of permutations of copies of arguments in a rigid variant of the resource calculus, and relate the coefficients of Taylor expansion with this structure, while Ehrhard and Regnier worked with groups of permutations of occurrences of variables. Finally, we extend all the results to a nondeterministic setting: by contrast with previous a...
The speculative ambition of replacing the old theory of program approximation based on syntactic con...
Almost 20 years ago Ehrhard and Regnier, inspired by the semantics of linear logic, discoveredthe po...
A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be expanded into a set of resou...
We show that the normal form of the Taylor expansion of a $\lambda$-term isisomorphic to its B\"ohm ...
International audienceIt has been known since Ehrhard and Regnier's seminal work on the Taylor expan...
AbstractWe define the complete Taylor expansion of an ordinary lambda-term as an infinite linear com...
International audienceWe introduce a notion of reduction on resource vectors, i.e. infinite linear c...
This paper introduces a variant of the resource calculus, the rigid resource calculus, in which a pe...
We introduce a groupoid of trees whose objects are (labelled, planar, rooted) trees, and whose morph...
The main observational equivalences of the untyped lambda-calculus have beencharacterized in terms o...
12 pagesInternational audienceWe introduce and study a version of Krivine's machine which provides a...
Originating in Girard's Linear logic, Ehrhard and Regnier's Taylor expansion of $\lambda$-terms has ...
International audienceIn the folklore of linear logic, a common intuition is that the structure of f...
Cette thèse étudie la notion d'approximation dans le lambda-calcul selon différentes perspectives. D...
A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be expanded into a set of resou...
The speculative ambition of replacing the old theory of program approximation based on syntactic con...
Almost 20 years ago Ehrhard and Regnier, inspired by the semantics of linear logic, discoveredthe po...
A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be expanded into a set of resou...
We show that the normal form of the Taylor expansion of a $\lambda$-term isisomorphic to its B\"ohm ...
International audienceIt has been known since Ehrhard and Regnier's seminal work on the Taylor expan...
AbstractWe define the complete Taylor expansion of an ordinary lambda-term as an infinite linear com...
International audienceWe introduce a notion of reduction on resource vectors, i.e. infinite linear c...
This paper introduces a variant of the resource calculus, the rigid resource calculus, in which a pe...
We introduce a groupoid of trees whose objects are (labelled, planar, rooted) trees, and whose morph...
The main observational equivalences of the untyped lambda-calculus have beencharacterized in terms o...
12 pagesInternational audienceWe introduce and study a version of Krivine's machine which provides a...
Originating in Girard's Linear logic, Ehrhard and Regnier's Taylor expansion of $\lambda$-terms has ...
International audienceIn the folklore of linear logic, a common intuition is that the structure of f...
Cette thèse étudie la notion d'approximation dans le lambda-calcul selon différentes perspectives. D...
A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be expanded into a set of resou...
The speculative ambition of replacing the old theory of program approximation based on syntactic con...
Almost 20 years ago Ehrhard and Regnier, inspired by the semantics of linear logic, discoveredthe po...
A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be expanded into a set of resou...