Related papers: Structure and Semantics
Categories, n-categories, double categories, and multicategories (among others) all have similar definitions as collections of cells with composition operations. We give an explicit description of the information required to define any…
We define $A_{\infty}$-structures -- algebras, coalgebras, modules, and comodules -- in an arbitrary monoidal DG category or bicategory by rewriting their definitions in terms of unbounded twisted complexes. We develop new notions of strong…
Categories can be identified -- up to isomorphism -- with polynomial comonads on Set. The left Kan extension of a functor along itself is always a comonad -- called the density comonad -- so it defines a category when its carrier is…
We apply the notion of relative adjoint functor to generalise closed monoidal categories. We define representations in such categories and give their relation with left actions of monoids. The translation of these representations under lax…
Let $A$ be a ring and $\M_A$ the category of $A$-modules. It is well known in module theory that for any $A $-bimodule $B$, $B$ is an $A$-ring if and only if the functor $-\otimes_A B: \M_A\to \M_A$ is a monad (or triple). Similarly, an $A…
In this paper we investigate the categories of braided objects, algebras and bialgebras in a given monoidal category, some pairs of adjoint functors between them and their relations. In particular we construct a braided primitive functor…
The primary goal of this paper is to present a unified way to transform the syntax of a logic system into certain initial algebraic structure so that it can be studied algebraically. The algebraic structures which one may choose for this…
Categorical Universal Logic is a theory of monad-relativised hyperdoctrines (or fibred universal algebras), which in particular encompasses categorical forms of both first-order and higher-order quantum logics as well as classical,…
In this paper we give a new foundational, categorical formulation for operations and relations and objects parameterizing them. This generalizes and unifies the theory of operads and all their cousins including but not limited to PROPs,…
Recent work in set theory indicates that there are many different notions of 'set', each captured by a different collection of axioms, as proposed by J. Hamkins in [Ham11]. In this paper we strive to give one class theory that allows for a…
It is known that the so-called monadic decomposition, applied to the adjunction connecting the category of bialgebras to the category of vector spaces via the tensor and the primitive functors, returns the usual adjunction between…
Using the theory of coalgebra, we introduce a uniform framework for adding modalities to the language of propositional geometric logic. Models for this logic are based on coalgebras for an endofunctor on some full subcategory of the…
This thesis deals with the specification and construction of syntax and operational semantics of a programming language. We work with a general notion of signature for specifying objects of a given category as initial objects in a suitable…
The recent trend in mathematics is towards a framework of abstract mathematical objects, rather than the more concrete approach of explicitly defining elements which objects were thought to consist of. A natural question to raise is whether…
Under a minimum of assumptions, we develop in generality the basic theory of universal algebra in a symmetric monoidal closed category $\mathcal{V}$ with respect to a specified system of arities $j:\mathcal{J} \hookrightarrow \mathcal{V}$.…
The category of contexts underlying a model of Martin-L\"of type theory with Unit-, $\Sigma$-, and $\Pi$-types need not be locally Cartesian closed, but is necessarily a $\pi$-clan. We exploit this $\pi$-clan structure to build the theory…
Completeness proofs in categorical semantics usually proceed by building a syntactic category whose composition is given by substitution. For untyped effectful Call-by-Value languages, this runs into a basic obstacle: there is no canonical…
In general, all constructions of algebraic topology are functorial; the notions of category, functor and natural transformation originated here. The arrow categories are more simple forms of the \emph{comma} categories and were introduced…
Based on the monoid classifier, we give an alternative axiomatization of Freyd's paracategories, which can be interpreted in any bicategory of partial maps. Assuming furthermore a free-monoid monad T in our ambient category, and…
The first part of this dissertation defines "dependently typed algebraic theories", which are a strict subclass of the generalised algebraic theories (GATs) of Cartmell. We characterise dependently typed algebraic theories as finitary…