International audienceLévy-Longo Trees and Böhm Trees are the best known tree structures on the λ-calculus. We give general conditions under which an encoding of the λ-calculus into the π-calculus is sound and complete with respect to such trees. We apply these conditions to various encodings of the call-by-name λ-calculus, showing how the two kinds of tree can be obtained by varying the behavioural equivalence adopted in the π-calculus and/or the encoding. The conditions are presented in the π-calculus but can be adapted to other concurrency formalisms
This work exploits the logical foundation of session types to determine what kind of type discipline...
The π-calculus is used as a model for programming languages. Its cons exhibit arbitrary concurrency,...
International audienceComputation can be considered by taking into account two dimensions: extension...
International audienceLévy-Longo Trees and Böhm Trees are the best known tree structures on the λ-ca...
International audienceLévy-Longo Trees and Böhm Trees are the best known tree structures on the λ-ca...
We study Milner's encoding of the call-by-value -calculus into the π-calculus. We show that, by tuni...
AbstractSangiorgi has shown that the semantics induced by Milner's encoding of the call-by-name λ-ca...
AbstractThe use of λ-calculus in richer settings, possibly involving parallelism, is examined in ter...
Following Milner's seminal paper, the representation of functions as processes has received consider...
This paper presents a logical approach to the translation of functional calculi into concurrent proc...
International audienceWe present fully abstract encodings of the call-by-name λ-calculus into HOcore...
International audienceIn a well-known and influential paper [17] Palamidessi has shown that the expr...
We prove decidability for contextual equivalence of the λμν-calculus, that is the simply-typed call-...
Abstract. Λµ-calculus is an extension of Parigot's λµ-calculus which (i) satisfies Separation t...
AbstractThe main result of the paper is a constructive proof of the following equivalence: two pureλ...
This work exploits the logical foundation of session types to determine what kind of type discipline...
The π-calculus is used as a model for programming languages. Its cons exhibit arbitrary concurrency,...
International audienceComputation can be considered by taking into account two dimensions: extension...
International audienceLévy-Longo Trees and Böhm Trees are the best known tree structures on the λ-ca...
International audienceLévy-Longo Trees and Böhm Trees are the best known tree structures on the λ-ca...
We study Milner's encoding of the call-by-value -calculus into the π-calculus. We show that, by tuni...
AbstractSangiorgi has shown that the semantics induced by Milner's encoding of the call-by-name λ-ca...
AbstractThe use of λ-calculus in richer settings, possibly involving parallelism, is examined in ter...
Following Milner's seminal paper, the representation of functions as processes has received consider...
This paper presents a logical approach to the translation of functional calculi into concurrent proc...
International audienceWe present fully abstract encodings of the call-by-name λ-calculus into HOcore...
International audienceIn a well-known and influential paper [17] Palamidessi has shown that the expr...
We prove decidability for contextual equivalence of the λμν-calculus, that is the simply-typed call-...
Abstract. Λµ-calculus is an extension of Parigot's λµ-calculus which (i) satisfies Separation t...
AbstractThe main result of the paper is a constructive proof of the following equivalence: two pureλ...
This work exploits the logical foundation of session types to determine what kind of type discipline...
The π-calculus is used as a model for programming languages. Its cons exhibit arbitrary concurrency,...
International audienceComputation can be considered by taking into account two dimensions: extension...