We lift the standard equivalence between fibrations and indexed categories to an
equivalence between monoidal fibrations and monoidal indexed categories, namely weak …

We study the existence of universal measuring comonoids P (A, B) for a pair of monoids A, B
in a braided monoidal closed category, and the associated enrichment of the category of …

Networks can be combined in various ways, such as overlaying one on top of another or
setting two side by side. We introduce" network models" to encode these ways of combining …

Dependent types provide a lightweight and modular means to integrate programming and
formal program verification. In particular, the types of programs written in dependently typed …

In this work, we explore a double categorical framework for categories of enriched graphs,
categories and the newly introduced notion of cocategories. A fundamental goal is to …

We introduce the notion of an enriched fibration, ie a fibration whose total category and base
category are enriched in those of a monoidal fibration in an appropriate way. Furthermore …

In this work, we continue the investigation of certain enrichments of dual algebraic structures
in monoidal double categories, that was initiated in [Vas19]. First, we re-visit monads and …

We study the existence of universal measuring comodules Q (M, N) for a pair of modules M,
N in a braided monoidal closed category, and the associated enrichment of the global …

The Grothendieck construction takes a prestack (or pseudofunctor) B^ op→ Cat and returns
a cartesian fibration over B. Classically, this construction works for categories with sets of …

In this thesis, we present a flexible framework for specifying and constructing operads which
are suited to reasoning about network construction. The data used to present these operads …