Monte Carlo simulation is an essential tool in emission tomography that can assist in the
design of new medical imaging devices, the optimization of acquisition protocols and the …

We introduce CLASS, a session-typed, higher-order, core language that supports concurrent
computation with shared linear state. We believe that CLASS is the first proposal for a …

We give a semantic account of the execution time (ie the number of cut elimination steps
leading to the normal form) of an untyped MELL net. We first prove that:(1) a net is head …

We study the complexity of reachability problems on branching extensions of vector addition
systems, which allows us to derive new non-elementary complexity bounds for fragments …

We study the weak call-by-value λ-calculus as a model for computational complexity theory
and establish the natural measures for time and space—the number of beta-reduction steps …

Session types describe the structure of communications implemented by channels. In
particular, they prescribe the sequence of communications, whether they are input or output …

We present QBAL, an extension of Girard, Scedrov and Scott's bounded linear logic. The
main novelty of the system is the possibility of quantifying over resource variables. This …

We present a polymorphic type system for lambda calculus ensuring that well-typed
programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a …

We propose a new type system for lambda-calculus ensuring that well-typed programs can
be executed in polynomial time: dual light affine logic (DIAL). DIAL has a simple type …

Terms of Church's λ-calculus can be considered equivalent along many different definitions,
but context equiv-alence is certainly the most direct and universally accepted one. If the …