This book is a textbook in basic category theory, written specifically to be read by
researchers and students in computing science. We expound the constructions we feel are …

Rewriting with conditional rewrite rules modulo a set E of structural axioms provides a
general framework for unifying a wide variety of models of concurrency. Concurrent rewriting …

In physics, Feynman diagrams are used to reason about quantum processes. In the 1980s, it
became clear that underlying these diagrams is a powerful analogy between quantum …

Interpreting η-conversion as an expansion rule in the simply-typed λ-calculus maintains the
confluence of reduction in a richer type structure. This use of expansions is supported by …

Starting from an exact correspondence between linear approximations and non-idempotent
intersection types, we develop a general framework for building systems of intersection …

Relational models of λ-calculus can be presented as type systems, the relational
interpretation of a λ-term being given by the set of its typings. Within a distributors-induced …

Generalized metrics, arising from Lawvere's view of metric spaces as enriched categories,
have been widely applied in denotational semantics as a way to measure to which extent …

Recent work on higher-dimensional type theory has explored connections between Martin-
Löf type theory, higher-dimensional category theory, and homotopy theory. These …

We develop further the theory of monoidal bicategories by introducing and studying bicate-
gorical counterparts of the notions of a linear explonential comonad, as considered in the …

We study a family of distributors-induced bicategorical models of λ-calculus, proving that
they can be syntactically presented via intersection type systems. We first introduce a class …