Add to ORKGInternational audienceWe study iteration and recursion operators in the denotational semantics of typed λ-calculi derived from the multiset relational model of linear logic. Although these operators are defined as fixpoints of typed functionals, we prove them finitary in the sense of Ehrhard's finiteness spaces
We prove that the existential fragment Σ12,ω of the third order logic TOω captures the relational c...
International audienceWe consider the call-by-value lambda-calculus extended with a may-convergent n...
This thesis is a contribution to the study of Church’s untyped λ-calculus, a term rewritingsystem h...
International audienceWe study iteration and recursion operators in the denotational semantics of ty...
International audienceWe study iteration and recursion operators in the denotational semantics of ty...
We study iteration and recursion operators in the denotational semantics of typed λ-calc...
We study iteration and recursion operators in the multiset relational model of linear logic and prov...
Finiteness spaces were introduced by Ehrhard as a refinement of the relational model of linear logic...
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...
AbstractThis article builds on a tutorial introduction to universal algebra for language theory (Cou...
AbstractWe introduce the notion of differential λ-category as an extension of Blute-Cockett-Seely's ...
AbstractWe show how to use intersection types for building models of a λ-calculus enriched with recu...
The notion of the least fixed-point of an operator is widely applied in computer science as, for ins...
AbstractAn expression such as ∀x(P(x)↔ϕ(P)), where P occurs in ϕ(P), does not always define P. When ...
We prove that the existential fragment Σ12,ω of the third order logic TOω captures the relational c...
International audienceWe consider the call-by-value lambda-calculus extended with a may-convergent n...
This thesis is a contribution to the study of Church’s untyped λ-calculus, a term rewritingsystem h...
International audienceWe study iteration and recursion operators in the denotational semantics of ty...
International audienceWe study iteration and recursion operators in the denotational semantics of ty...
We study iteration and recursion operators in the denotational semantics of typed λ-calc...
We study iteration and recursion operators in the multiset relational model of linear logic and prov...
Finiteness spaces were introduced by Ehrhard as a refinement of the relational model of linear logic...
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...
AbstractThis article builds on a tutorial introduction to universal algebra for language theory (Cou...
AbstractWe introduce the notion of differential λ-category as an extension of Blute-Cockett-Seely's ...
AbstractWe show how to use intersection types for building models of a λ-calculus enriched with recu...
The notion of the least fixed-point of an operator is widely applied in computer science as, for ins...
AbstractAn expression such as ∀x(P(x)↔ϕ(P)), where P occurs in ϕ(P), does not always define P. When ...
We prove that the existential fragment Σ12,ω of the third order logic TOω captures the relational c...
International audienceWe consider the call-by-value lambda-calculus extended with a may-convergent n...
This thesis is a contribution to the study of Church’s untyped λ-calculus, a term rewritingsystem h...