We seek a unified account of modularity for computational effects. We begin by reformulating
Moggi's monadic paradigm for modelling computational effects using the notion of enriched …

It is well-known that the simply typed lambda-calculus is modeled by any cartesian closed
category (CCC). This correspondence suggests giving typed functional programs a variety of …

We present natural deduction systems and associated modal lambda calculi for the
necessity fragments of the normal modal logics K, T, K4, GL and S4. These systems are in …

We present and study a simple Call-By-Push-Value lambda-calculus with fix-points and
recursive types. We explain its connection with Linear Logic by presenting a denotational …

We introduce a probabilistic extension of Levy's Call-By-Push-Value. This extension consists
simply in adding a “flipping coin” boolean closed atomic expression. This language can be …

The structure theorem of Joyal, Street and Verity says that every traced monoidal category
arises as a monoidal full subcategory of the tortile monoidal category Int. In this paper we …

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 introduce a general diagrammatic theory of digital circuits, based on connections
between monoidal categories and graph rewriting. The main achievement of the paper is …

Denotational semantics can be based on algebras with additional structure (order, metric,
etc.) which makes it possible to interpret recursive specifications. It was the idea of Elgot to …

We develop a fixed-point extension of quantitative equational logic and give semantics in
one-bounded complete quantitative algebras. Unlike previous related work about fixed …