Effects and coeffects are two general, complementary aspects of program behaviour. They
roughly correspond to computations which change the execution context (effects) versus …

Finding a denotational semantics for higher order quantum computation is a long-standing
problem in the semantics of quantum programming languages. Most past approaches to this …

The category Rel of sets and relations yields one of the simplest denotational semantics of
Linear Logic (LL). It is known that Rel is the biproduct completion of the Boolean ring. We …

Starting from an exact correspondence between linear approximations and non-idempotent
intersection types, we develop a general framework for building systems of intersection …

We present a probabilistic version of PCF, a well-known simply typed universal functional
language. The type hierarchy is based on a single ground type of natural numbers. Even if …

The description of resources in game semantics has never achieved the simplicity and
precision of linear logic, because of the misleading conception that linear logic is more …

Motivated by a tight connection between Joyal's combinatorial species and quantitative
models of linear logic, this paper introduces weighted generalised species (or weighted …

We present an overview of some recent work on the quantitative semantics of the λ-calculus.
Our starting point is the fundamental degenerate model of linear logic, the relational model …

We consider a non-uniform affine lambda-calculus, called parsimonious, and endow its
terms with two type disciplines: simply-typed and with linear polymorphism. We show that …

The differential λ-calculus is a paradigmatic functional programming language endowed
with a syntactical differentiation operator that allows the application of a program to an …