Related papers: Compositional Program Verification with Polynomial…
The goal of this paper is to prove coherence results with respect to relational graphs for monoidal monads and comonads, i.e. monads and comonads in a monoidal category such that the endofunctor of the monad or comonad is a monoidal functor…
Autonomous systems require the management of several model views to assure properties such as safety and security among others. A crucial issue in autonomous systems design assurance is the notion of emergent behavior; we cannot use their…
In their usual form, representation independence metatheorems provide an external guarantee that two implementations of an abstract interface are interchangeable when they are related by an operation-preserving correspondence. If our…
We present techniques for reasoning about constructor classes that (like the monad class) fix polymorphic operations and assert polymorphic axioms. We do not require a logic with first-class type constructors, first-class polymorphism, or…
We present a unified framework for categorical systems theory which packages a collection of open systems, their interactions, and their maps into a symmetric monoidal loose right module of systems over a symmetric monoidal double category…
We exhibit a monoidal structure on the category of finite sets indexed by P-trees for a finitary polynomial endofunctor P. This structure categorifies the monoid scheme (over Spec N) whose semiring of functions is (a P-version of) the…
We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…
Emerging computational paradigms, such as probabilistic and hybrid programming, introduce new primitive operations that often need to be combined with classic programming constructs. However, it still remains a challenge to provide a…
The feasibility of a classification-by-rank program for modular categories follows from the Rank-Finiteness Theorem. We develop arithmetic, representation theoretic and algebraic methods for classifying modular categories by rank. As an…
We introduce the normal produoidal category of monoidal contexts over an arbitrary monoidal category. In the same sense that a monoidal morphism represents a process, a monoidal context represents an incomplete process: a piece of a…
We introduce DafnyCOMP, a benchmark for evaluating large language models (LLMs) on compositional specification generation in Dafny. Unlike prior benchmarks that focus on single-function tasks, DafnyCOMP targets programs composed of multiple…
Let $\mathcal C$ be a category with finite colimits, and let $(\mathcal E,\mathcal M)$ be a factorisation system on $\mathcal C$ with $\mathcal M$ stable under pushouts. Writing $\mathcal C;\mathcal M^{\mathrm{op}}$ for the symmetric…
We present a method of constructing monoidal, braided monoidal, and symmetric monoidal bicategories from corresponding types of monoidal double categories that satisfy a lifting condition. Many important monoidal bicategories arise…
We propose a categorical framework for linear-time temporal verification of effectful higher-order programs, including probabilistic higher-order programs. Our framework provides a generic denotational reduction -- namely, a denotational…
This paper provides a mathematical framework for client-server communication that results in a modular and type-safe architecture. It is informed and motivated by the software engineering practice of developing server backends with a…
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 is called a \emph{network model}, a monoidal variant of…
Given a monoidal adjunction, we show that the right adjoint induces a braided lax monoidal functor between the corresponding Drinfeld centers provided that certain natural transformations, called projection formula morphisms, are…
Monads are a useful tool for structuring effectful features of computation such as state, non-determinism, and continuations. In the last decade, several generalisations of monads have been suggested which provide a more fine-grained model…
Many machine learning algorithms represent input data with vector embeddings or discrete codes. When inputs exhibit compositional structure (e.g. objects built from parts or procedures from subroutines), it is natural to ask whether this…
We introduce dicodensity monads: a generalisation of pointwise codensity monads generated by functors to monads generated by mixed-variant bifunctors. Our construction is based on the notion of strong dinaturality (also known as Barr…