Related papers: Variable binding, symmetric monoidal closed theori…
We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…
This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…
Bigraphs are an emerging modeling formalism for structures in ubiquitous computing. Besides an algebraic notation, which can be adopted to provide an algebraic syntax for bigraphs, the bigraphical theory introduces a visual concrete syntax…
With a view on applications in computing, in particular concurrency theory and higher-dimensional rewriting, we develop notions of $n$-fold monoid and comonoid objects in $n$-fold monoidal categories and bicategories. We present a series of…
String rewriting systems have proved very useful to study monoids. In good cases, they give finite presentations of monoids, allowing computations on those and their manipulation by a computer. Even better, when the presentation is…
We prove that the homotopy theory of parsummable categories (as defined by Schwede) with respect to the underlying equivalences of categories is equivalent to the usual homotopy theory of symmetric monoidal categories. In particular, this…
M(atrix) theory on an orbifold and classical two-branes therein are studied with particular emphasis to heterotic M(atrix) theory on $S_1/Z_2$ relevant to strongly coupled heterotic and dual Type IA string theories. By analyzing orbifold…
In this paper we provide a unifying description of different types of semantics of modal logic found in the literature via the framework of topological categories. In the style of categorical logic, we establish an exact correspondence…
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…
This paper introduces the concept of distorted monoidal categories, a generalization of monoidal and braided monoidal categories that supports non-reversible and direction-sensitive tensor structures. Unlike the classical setting, where the…
We consider a closure operator $c$ of finite type on the space $SMod(\mathcal M)$ of thick $\mathcal K$-submodules of a triangulated category $\mathcal M$ that is a module over a tensor triangulated category $(\mathcal K,\otimes,1)$. Our…
This paper gives an explicit description of the categorical operad whose algebras are precisely symmetric monoidal categories. This allows us to place the operad in a sequence of four, and therefore a sequence of four successively stricter…
This work studies the proof theory of left (right) skew monoidal closed categories and skew monoidal bi-closed categories from the perspective of non-associative Lambek calculus. Skew monoidal closed categories represent a relaxed version…
Turi and Plotkin's bialgebraic semantics is an abstract approach to specifying the operational semantics of a system, by means of a distributive law between its syntax (encoded as a monad) and its dynamics (an endofunctor). This setup is…
We show that braided, sylleptic and symmetric monoidal bicategories are precisely the $\mathsf{E}_k$-monoids in the cartesian monoidal $(\infty,1)$-category of bicategories for respective integers $k$. To manage the underlying computations,…
In this paper we study the topology of the cobordism category of open and closed strings. This is a 2-category in which the objects are compact one-manifolds whose boundary components are labeled by an indexing set (the set of "D-branes"),…
This work is about diagrammatic languages, how they can be represented, and what they in turn can be used to represent. More specifically, it focuses on representations and applications of string diagrams. String diagrams are used to…
We review recent developments in the construction of heterotic and type II string field theories and their various applications. These include systematic procedures for determining the shifts in the vacuum expectation values of fields under…
We provide a new approach to categorical graph and hypergraph theory by using categorical syntax and semantics. For each monoid $M$ and action on a set $X$, there is an associated presheaf topos of $(X,M)$-graphs where each object can be…
We consider the structures given by repeatedly generalising the definition of finite state automata by symmetry considerations, and constructing analogues of transition monoids at each step. This approach first gives us non-deterministic…