Differential privacy offers a way to answer queries about sensitive information while
providing strong, provable privacy guarantees, ensuring that the presence or absence of a …

We propose to unify the treatment of a broad range of modalities in typed lambda calculi. We
do so by defining a generic structure of modalities, and show that this structure arises …

Linear logic is well known for its resource-awareness, which has inspired the design of
several resource management mechanisms in programming language design. Its resource …

A system of linear dependent types for the lambda calculus with full higher-order recursion,
called dlPCF, is introduced and proved sound and relatively complete. Completeness holds …

Bounded linear types have proved to be useful for automated resource analysis and control
in functional programming languages. In this paper we introduce a bounded linear typing …

Graded Type Theory provides a mechanism to track and reason about resource usage in
type systems. In this paper, we develop GraD, a novel version of such a graded dependent …

We combine dependent types with linear type systems that soundly and completely capture
polynomial time computation. We explore two systems for capturing polynomial time: one …

The overall purpose of the present work is to lay the foundations for a new approach to
bridge logic and probabilistic computation. To this aim we introduce extensions of classical …

In this paper, we take a pervasively effectful (in the style of ML) typed lambda calculus, and
show how to extend it to permit capturing pure expressions with types. Our key observation …

In a recent paper, Girard (2012) proposed to use his recent construction of a geometry of
interaction in the hyperfinite factor (Girard 2011) in an innovative way to characterize …