We show that a measure-based denotational semantics for probabilistic programming is
commutative. The idea underlying probabilistic programming languages (Anglican, Church …

We give a categorical semantics to the call-by-name and call-by-value versions of Parigot's
λμ-calculus with disjunction types. We introduce the class of control categories, which …

Probability theory and statistics are fundamental disciplines in a data-driven world. Synthetic
probability theory is a general, axiomatic formalism to describe their underlying structures …

We present a categorical characterization of term graphs (ie, finite, directed acyclic graphs
labeled over a signature) that parallels the well-known characterization of terms as arrows of …

We universally characterize the produoidal category of monoidal lenses over a monoidal
category. In the same way that each category induces a cofree promonoidal category of …

This thesis introduces quantum natural language processing (QNLP) models based on a
simple yet powerful analogy between computational linguistics and quantum mechanics …

Network Algebra considers the algebraic study of networks and their behaviour. It contains
general results on the algebraic theory of networks, recent results on the algebraic theory of …

Premonoidal and Freyd categories are both generalized by non-cartesian Freyd categories:
effectful categories. We construct string diagrams for effectful categories in terms of the string …

We extend the theory of formal languages in monoidal categories to the multi-sorted,
symmetric case, and show how this theory permits a graphical treatment of topics in …

We give two classes of sound and complete models for the computational λ-calculus, or λ c-
calculus. For the first, we generalise the notion of cartesian closed category to that of closed …