We present Quantitative Type Theory, a Type Theory that records usage information for each
variable in a judgement, based on a previous system by McBride. The usage information is …

We introduce two extensions of the λ-calculus with a probabilistic choice operator, Λ⊕ cbv
and Λ⊕ cbn, modeling respectively call-by-value and call-by-name probabilistic …

Girard's Geometry of Interaction (GoI) is interaction based semantics of linear logic proofs
and, via suitable translations, of functional programs in general. Its mathematical cleanness …

We study the two Girard's translations of intuitionistic implication into linear logic by
exploiting the bang calculus, a paradigmatic functional language with an explicit box …

This paper introduces the exponential substitution calculus (ESC), a new presentation of cut
elimination for IMELL, based on proof terms and building on the idea that exponentials can …

In any setting in which observable properties have a quantitative flavor, it is natural to
compare computational objects by way of metrics rather than equivalences or partial orders …

In this paper, we propose an approach to quantum λ-calculi. The 'quantum data-classical
control'paradigm is considered. Starting from a measurement-free untyped quantum λ …

We study the reduction in a-calculus derived from Moggi's computational one, which we call
the computational core. The reduction relation consists of rules obtained by orienting three …

While much of the current study on quantum computation employs low-level formalisms such
as quantum circuits, several high-level languages/calculi have been recently proposed …

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 …