Evaluating higher-order functional programs through abstract machines inspired by the
geometry of the interaction is known to induce space efficiencies, the price being time …

We study multitoken interaction machines in the context of a very expressive linear logical
system with exponentials, fix points and synchronization. The advantage of such machines …

We give an axiomatic presentation of sharing-via-labelling for weak lambda-calculi, that
makes it possible to formally compare many different approaches to fully lazy sharing, and …

The resource λ-calculus is a variation of the λ-calculus where arguments are superpositions
of terms and must be linearly used; hence, it is a model for linear and non-deterministic …

In this paper, we explore a new approach to abstract machines and optimal reduction
through streams, ubiquitary objects in mathematics and computer science. We first define a …

We design a library for binary-field arithmetic and we supply a core application programming
interface (API) completely developed in a formal system we introduce: Typeable Functional …

We study multitoken interaction machines in the context of a very expressive logical system
with exponentials, fixpoints and synchronization. The advantage of such machines is to …

Due to their" inherent parallelism", interaction nets have since their introduction been
considered as an attractive implementation mechanism for functional programming. We …

In this paper we introduce a typed, concurrent $\lambda $-calculus with references featuring
explicit substitutions for variables and references. Alongside usual safety properties, we …

In this paper, we show how to interpret a language featuring concurrency, references and
replication into proof nets, which correspond to a fragment of differential linear logic. We …