English
Related papers

Related papers: Rewriting modulo symmetric monoidal structure

200 papers

Monoidal closed categories naturally model NMILL, non-commutative multiplicative intuitionistic linear logic: the monoidal unit and tensor interpret the multiplicative verum and conjunction; the internal hom interprets linear implication.…

Logic in Computer Science · Computer Science 2022-04-15 Tarmo Uustalu , Niccolò Veltri , Cheng-Syuan Wan

On the topic of probabilistic rewriting, there are several works studying both termination and confluence of different systems. While working with a lambda calculus modelling quantum computation, we found a system with probabilistic…

Logic in Computer Science · Computer Science 2022-04-11 Rafael Romero , Alejandro Díaz-Caro

Adhesive categories provide an abstract framework for the algebraic approach to rewriting theory, where many general results can be recast and uniformly proved. However, checking that a model satisfies the adhesivity properties is sometimes…

Logic in Computer Science · Computer Science 2022-06-16 Davide Castelnovo , Fabio Gadducci , Marino Miculan

We study categorical models for the unitless fragment of multiplicative linear logic. We find that the appropriate notion of model is a special kind of promonoidal category. Since the theory of promonoidal categories has not been developed…

Logic in Computer Science · Computer Science 2013-05-14 Robin Houston

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…

Logic · Mathematics 2025-01-03 Cheng-Syuan Wan

The physical motivations and the basic construction rules for Type I strings and M-theory compactifications are reviewed in light of the recent developments. The first part contains the basic theoretical ingredients needed for building…

High Energy Physics - Phenomenology · Physics 2010-04-06 Emilian Dudas

We give a natural-deduction-style type theory for symmetric monoidal categories whose judgmental structure directly represents morphisms with tensor products in their codomain as well as their domain. The syntax is inspired by Sweedler…

Category Theory · Mathematics 2021-07-13 Michael Shulman

We explore the moduli space of heterotic strings in two dimensions. In doing so, we introduce new lines of compactified theories with Spin(24) gauge symmetry and discuss compactifications with Wilson lines. The phase structure of d=2…

High Energy Physics - Theory · Physics 2008-11-26 Joshua L. Davis

In category theory, the use of string diagrams is well known to aid in the intuitive understanding of certain concepts, particularly when dealing with adjunctions and monoidal categories. We show that string diagrams are also useful in…

Category Theory · Mathematics 2024-07-19 Kenji Nakahira

String theory is the leading contemporary framework to explore the synthesis of quantum mechanics with gravity. String phenomenology aims to study string theory while maintaining contact with observational data. The fermionic $Z_2\times…

High Energy Physics - Theory · Physics 2020-03-18 Alon E Faraggi

We define a notion of symmetric monoidal closed (SMC) theory, consisting of a SMC signature augmented with equations, and describe the classifying categories of such theories in terms of proof nets.

Logic in Computer Science · Computer Science 2009-06-08 Richard Garner , Tom Hirschowitz , Aurélien Pardon

String theory gives a well defined procedure for computing the S-matrix of BPS or a class of massless states, but similar calculation for general massive states is plagued with difficulties due to mass renormalization effect. In this paper…

High Energy Physics - Theory · Physics 2015-06-17 Roji Pius , Arnab Rudra , Ashoke Sen

A partial monoid $P$ is a set with a partial multiplication $\times$ (and total identity $1_P$) which satisfies some associativity axiom. The partial monoid $P$ may be embedded in a free monoid $P^*$ and the product $\star$ is simulated by…

Discrete Mathematics · Computer Science 2010-09-30 Laurent Poinsot , Gérard Duchamp , Christophe Tollu

E-graphs are a data structure for equational reasoning and optimization over ground terms. One of the benefits of e-graph rewriting is that it can declaratively handle useful but difficult to orient identities like associativity and…

Programming Languages · Computer Science 2025-04-22 Philip Zucker

We show that B-model topological strings on local Calabi-Yau threefolds are large N duals of matrix models, which in the planar limit naturally give rise to special geometry. These matrix models directly compute F-terms in an associated N=1…

High Energy Physics - Theory · Physics 2010-04-05 Robbert Dijkgraaf , Cumrun Vafa

We introduce string diagrams for graded symmetric monoidal categories. Our approach includes a definition of graded monoidal theory and the corresponding freely generated syntactic category. Also, we show how an axiomatic presentation for…

Category Theory · Mathematics 2026-01-12 Ralph Sarkis , Fabio Zanasi

We present a type system for strategy languages that express program transformations as compositions of rewrite rules. Our row-polymorphic type system assists compiler engineers to write correct strategies by statically rejecting non…

Programming Languages · Computer Science 2021-03-26 Rongxiao Fu , Xueying Qin , Ornela Dardha , Michel Steuwer

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…

Category Theory · Mathematics 2021-05-13 Tobias Lenz

This thesis provides an introduction to the various category theory ideas employed in topological quantum field theory. These theories are viewed as symmetric monoidal functors from topological cobordism categories into the category of…

Quantum Algebra · Mathematics 2007-05-23 Bruce H. Bartlett

Kan extensions provide a natural general framework for a variety of combinatorial problems. We have developed rewriting procedures for Kan extensions (over the category of sets) and this enables one program to address a wide range of…

Combinatorics · Mathematics 2007-05-23 Anne Heyworth