16 citations · 55 across the 11 of their papers we have counts for
11 papers
First-order store and visibility in name-passing calculi
Daniel Hirschkoff, Iwan Quémerais, Davide Sangiorgi
The -calculus is the paradigmatical name-passing calculus. While being purely name-passing, it allows the representation of higher-order functions and store. We study how -ca…
Using Pi-Calculus Names as Locks
Daniel Hirschkoff, Enguerrand Prebet
Locks are a classic data structure for concurrent programming. We introduce a type system to ensure that names of the asynchronous pi-calculus are used as locks. Our calculus also…
Eager Functions as Processes (long version)
Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi
We study Milner's encoding of the call-by-value -calculus into the -calculus. We show that, by tuning the encoding to two subcalculi of the -calculus (Internal and Asy…
Eager Functions as Processes
Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi
We study Milner's encoding of the call-by-value -calculus into the -calculus. We show that, by tuning the encoding to two subcalculi of the -calculus (Internal and Asy…
On sequentiality and well-bracketing in the -calculus
Daniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi
The -calculus is used as a model for programming languages. Its contexts exhibit arbitrary concurrency, making them very discriminating. This may prevent validating desirable be…
Divergence and unique solution of equations
Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi
We study proof techniques for bisimilarity based on unique solution of equations. We draw inspiration from a result by Roscoe in the denotational setting of CSP and for failure sem…