Related papers: Rewriting Modulo Traced Comonoid Structure
We propose a graphical language that accommodates two monoidal structures: a multiplicative one for pairing and an additional one for branching. In this colored PROP, whether wires in parallel are linked through the multiplicative structure…
We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…
Rewriting logic is naturally concurrent: several subterms of the state term can be rewritten simultaneously. But state terms are global, which makes compositionality difficult to achieve. Compositionality here means being able to decompose…
We introduce a framework for emulating graphs and, through them, curved spaces of arbitrary dimension, using arrays of superconducting wires. The array consists of two stacked layers of wires, horizontal and vertical, such that wires are…
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 establish an enrichment of V-categories in V-cocategories, which…
We observe that the existence of sequential and parallel composition supermaps in higher order theories of transformations can be formalised using enriched category theory. Encouraged by relevant examples such as unitary supermaps and…
The Transformer architecture excels in a variety of language modeling tasks, outperforming traditional neural architectures such as RNN and LSTM. This is partially due to its elimination of recurrent connections, which allows for parallel…
In recent work, comonads and associated structures have been used to analyse a range of important notions in finite model theory, descriptive complexity and combinatorics. We extend this analysis to Hybrid logic, a widely-studied extension…
We discuss string diagrams for timed process theories -- represented by duoidally-graded symmetric strict monoidal categories -- built upon the string diagrams of pinwheel double categories.
Fong developed `decorated cospans' to model various kinds of open systems: that is, systems with inputs and outputs. In this framework, open systems are seen as the morphisms of a category and can be composed as such, allowing larger open…
Whereas string diagrams for strict monoidal categories are well understood, and have found application in several fields of Computer Science, graphical formalisms for non-strict monoidal categories are far less studied. In this paper, we…
Deep learning, despite its remarkable achievements, is still a young field. Like the early stages of many scientific disciplines, it is marked by the discovery of new phenomena, ad-hoc design decisions, and the lack of a uniform and…
Classical finite association schemes lead to a finite-dimensional algebras which are generated by finitely many stochastic matrices. Moreover, there exist associated finite hypergroups. The notion of classical discrete association schemes…
We introduce Flashback, a reversible string decomposition that repeatedly peels the maximal leading and trailing character runs from a sentinel-wrapped input, recording each pair as one bilateral token. Decomposition and reconstruction both…
Double-pushout rewriting is an established categorical approach to the rule-based transformation of graphs and graph-like objects. One of its standard results is the construction of concurrent rules and the Concurrency Theorem pertaining to…
We revisit Kapranov and Voevodsky's idea of spaces modelled on combinatorial pasting diagrams, now as a framework for higher-dimensional rewriting and the basis of a model of weak omega-categories. In the first part, we elaborate on…
This paper presents a framework based on matrices of monoids for the study of coupled cell networks. We formally prove within the proposed framework, that the set of results about invariant synchrony patterns for unweighted networks also…
In previous work, we introduce an axiomatic framework within which to prove theorems about many varieties of infinite-dimensional categories simultaneously. In this paper, we establish criteria implying that an $\infty$-category - for…
A combinatorial theory of associative $n$-categories has recently been proposed, with strictly associative and unital composition in all dimensions, and the weak structure arising as a combinatorial notion of homotopy with a natural…
We develop a homotopy theory for additive categories endowed with endofunctors, analogous to the concept of a model structure. We use it to construct the homotopy theory of a Hovey triple (which consists of two compatible complete cotorsion…