We introduce a refinement of the l-calculus, where the argument of a function is a bag of resources, that is a multiset of terms, whose multiplicities indicate how many copies of them are available. We show that this l-calculus with multiplicities has a natural functionality theory, similar to Coppo and Dezani's intersection type discipline. In our functionality theory the conjunction is managed in a multiplicative manner, according to Girard's terminology. We show that this provides an adequate interpretation of the calculus of the calculus, by establishing that a term is convergent if and only if it has a non-trivial functional character
Giuseppe Longo. The Lambda-Calculus: connections to higher type Recursion Theory, Proof-Theory, Cat...
International audienceWe study the resource calculus -- the non-lazy version of Boudol's lambda-calc...
Projet CHLOE, Projet PARACategorical combinators and more recently ls-calculus have been introduced ...
International audienceIn our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (w...
This thesis deals with the management of explicit resources in functional languages, stressing on pr...
We introduce a calculus for concurrent and communicating processes, which is a direct and simple ext...
Projet CHLOEThe l-calculus is known to be the theoretical base of functional programming languages. ...
We study the semantics of a resource sensitive extension of the lambda-calculus in a canonical refle...
This paper exhibits accurate encodings of the l-calculus in the ¹-calculus. The former is canonical ...
In a previous work we introduced the {\em generalised multiary $\lambda$-calculus} lambda-Jm, an ex...
We present differential linear logic and its models, the associated resource and differential lambda...
We study a l-calculus enriched with a non-deterministic choice combinator. We show that this combina...
Thanks to the Curry-Howard isomorphism, typed lambda-calculi provide a convenient logical framework ...
AbstractWe define the complete Taylor expansion of an ordinary lambda-term as an infinite linear com...
This article is about a categorical approach modelling a simple term calculus, named ?l?-calculus. T...
Giuseppe Longo. The Lambda-Calculus: connections to higher type Recursion Theory, Proof-Theory, Cat...
International audienceWe study the resource calculus -- the non-lazy version of Boudol's lambda-calc...
Projet CHLOE, Projet PARACategorical combinators and more recently ls-calculus have been introduced ...
International audienceIn our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (w...
This thesis deals with the management of explicit resources in functional languages, stressing on pr...
We introduce a calculus for concurrent and communicating processes, which is a direct and simple ext...
Projet CHLOEThe l-calculus is known to be the theoretical base of functional programming languages. ...
We study the semantics of a resource sensitive extension of the lambda-calculus in a canonical refle...
This paper exhibits accurate encodings of the l-calculus in the ¹-calculus. The former is canonical ...
In a previous work we introduced the {\em generalised multiary $\lambda$-calculus} lambda-Jm, an ex...
We present differential linear logic and its models, the associated resource and differential lambda...
We study a l-calculus enriched with a non-deterministic choice combinator. We show that this combina...
Thanks to the Curry-Howard isomorphism, typed lambda-calculi provide a convenient logical framework ...
AbstractWe define the complete Taylor expansion of an ordinary lambda-term as an infinite linear com...
This article is about a categorical approach modelling a simple term calculus, named ?l?-calculus. T...
Giuseppe Longo. The Lambda-Calculus: connections to higher type Recursion Theory, Proof-Theory, Cat...
International audienceWe study the resource calculus -- the non-lazy version of Boudol's lambda-calc...
Projet CHLOE, Projet PARACategorical combinators and more recently ls-calculus have been introduced ...