Dependent types allow us to express precisely what a function is intended to do. Recent
work on Quantitative Type Theory (QTT) extends dependent type systems with linearity, also …

We introduce MTT, a dependent type theory which supports multiple modalities. MTT is
parametrized by a mode theory which specifies a collection of modes, modalities, and …

We introduce the calculus of neo-Peircean relations, a string diagrammatic extension of the
calculus of binary relations that has the same expressivity as first order logic and comes with …

We introduce a general theory of quantitative and metric rewriting systems, namely systems
with a rewriting relation enriched over quantales modelling abstract quantities. We develop …

Programmers can often improve the performance of their programs by reducing heap
allocations: either by allocating on the stack or reusing existing memory in-place. However …

Graded modal types systems and coeffects are becoming a standard formalism to deal with
context-dependent, usage-sensitive computations, especially when combined with …

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 present a graded modal type theory, a dependent type theory with grades that can be
used to enforce various properties of the code. The theory has Π-types, weak and strong Σ …

Graded type theories are an emerging paradigm for augmenting the reasoning power of
types with parameterizable, fine-grained analyses of program properties. There have been …

We solve the inhabitation problem for a language called λ!, a subsuming paradigm (inspired
by call-by-push-value) being able to encode, among others, call-by-name and call-by-value …