Related papers: Rewriting modulo symmetric monoidal structure
Hypergraphs provide a natural way to represent polyadic relationships in network data. For large hypergraphs, it is often difficult to visually detect structures within the data. Recently, a scalable polygon-based visualization approach was…
We undertake a detailed investigation into the structure of permutations in monotone grid classes whose row-column graphs do not contain components with more than one cycle. Central to this investigation is a new decomposition, called the…
The non-empty finite subsets of a multiplicatively written monoid form a monoid under setwise multiplication. The same holds for finite subsets containing the identity element. Partly due to their unusual arithmetic properties, these…
A string diagram is a two-dimensional graphical representation that can be described as a one-dimensional term generated from a set of primitives using sequential and parallel compositions. Since different syntactic terms may represent the…
The lambda-Pi-calculus Modulo is a variant of the lambda-calculus with dependent types where beta-conversion is extended with user-defined rewrite rules. It is an expressive logical framework and has been used to encode logics and type…
Skew monoidal categories are monoidal categories with non-invertible `coherence' morphisms. As shown in a previous paper bialgebroids over a ring R can be characterized as the closed skew monoidal structures on the category Mod R in which…
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…
We introduce two families of diagrammatic monoidal supercategories. The first family, depending on an associative superalgebra, generalizes the oriented Brauer category. The second, depending on an involutive superalgebra, generalizes the…
In this paper we examine a number of term rewriting system for integer number representations, building further upon the datatype defining systems described in [2]. In particular, we look at automated methods for proving confluence and…
We demonstrate how the fundamental supersymmetric theory at high energy scales can be reconstructed using precision data expected at future high energy collider experiments. We have studied a set of representative examples in this context:…
Inspired by the tachyon-free non-supersymmetric heterotic SO(16)xSO(16) string we consider a special class of non-supersymmetric field theories: Those that can be obtained from supersymmetric field theories by supersymmetry breaking twists.…
This paper presents general syntactic conditions ensuring the strong normalization and the logical consistency of the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions and predicates defined…
This paper deals with model transformation based on attributed graph rewriting. Our contribution investigates a single pushout approach for applying the rewrite rules. The computation of graph attributes is obtained through the use of typed…
We define string geometry: spaces of superstrings including the interactions, their topologies, charts, and metrics. Trajectories in asymptotic processes on a space of strings reproduce the right moduli space of the super Riemann surfaces…
Equivariant monoids are very important objects in many branches of mathematics: they combine the notion of multiplication and the concept of a group action. In this paper we will construct categories which encode the structure borne by…
Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…
This thesis is devoted to the study of a calculus that describes the application of conditional rewriting rules and the obtained results at the same level of representation. We introduce the rewriting calculus, also called the rho-calculus,…
We show how to reconstruct the topology on the monoid of endomorphisms of the rational numbers under the strict or reflexive order relation, and the polymorphism clone of the rational numbers under the reflexive relation. In addition we…
The basic principle of graph rewriting is the stepwise replacement of subgraphs inside a host graph. A challenge in such replacement steps is the treatment of the patch graph, consisting of those edges of the host graph that touch the…