اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEvaluating Linear Functions to Symmetric Monoidal Categories
54
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A number of domain specific languages, such as circuits or data-science workflows, are best expressed as diagrams of boxes connected by wires. Unfortunately, functional languages have traditionally been ill-equipped to embed this sort of languages. The Arrow abstraction is an approximation, but we argue that it does not capture the right properties. A faithful abstraction is Symmetric Monoidal Categories (SMCs), but,so far,it hasnt been convenient to use. We show how the advent of linear typing in Haskell lets us bridge this gap. We provide a library which lets us program in SMCs with linear functions instead of SMC combinators. This considerably lowers the syntactic overhead of the EDSL to be on par with that of monadic DSLs. A remarkable feature of our library is that, contrary to previously known methods for categories, it does not use any metaprogramming.
قيم البحث
اقرأ أيضاً
Indexed symmetric monoidal categories are an important refinement of bicategories -- this structure underlies several familiar bicategories, including the homotopy bicategory of parametrized spectra, and its equivariant and fiberwise generalizations.
In this paper, we extend existing coherence theorems to the setting of indexed symmetric monoidal categories. The most central theorem states that a large family of operations on a bicategory defined from an indexed symmetric monoidal category are all canonically isomorphic. As a part of this theorem, we introduce a rigorous graphical calculus that specifies when two such operations admit a canonical isomorphism.
We use Luries symmetric monoidal envelope functor to give two new descriptions of $infty$-operads: as certain symmetric monoidal $infty$-categories whose underlying symmetric monoidal $infty$-groupoids are free, and as certain symmetric monoidal $inf
ty$-categories equipped with a symmetric monoidal functor to finite sets (with disjoint union as tensor product). The latter leads to a third description of $infty$-operads, as a localization of a presheaf $infty$-category, and we use this to give a simple proof of the equivalence between Luries and Barwicks models for $infty$-operads.
Applications of category theory often involve symmetric monoidal categories (SMCs), in which abstract processes or operations can be composed in series and parallel. However, in 2020 there remains a dearth of computational tools for working with SMCs
. We present an unbiased approach to implementing symmetric monoidal categories, based on an operad of directed, acyclic wiring diagrams. Because the interchange law and other laws of a SMC hold identically in a wiring diagram, no rewrite rules are needed to compare diagrams. We discuss the mathematics of the operad of wiring diagrams, as well as its implementation in the software package Catlab.
The category of Hilbert modules may be interpreted as a naive quantum field theory over a base space. Open subsets of the base space are recovered as idempotent subunits, which form a meet-semilattice in any firm braided monoidal category. There is a
n operation of restriction to an idempotent subunit: it is a graded monad on the category, and has the universal property of algebraic localisation. Spacetime structure on the base space induces a closure operator on the idempotent subunits. Restriction is then interpreted as spacetime propagation. This lets us study relativistic quantum information theory using methods entirely internal to monoidal categories. As a proof of concept, we show that quantum teleportation is only successfully supported on the intersection of Alice and Bobs causal future.
We show how to construct a Gamma-bicategory from a symmetric monoidal bicategory, and use that to show that the classifying space is an infinite loop space upon group completion. We also show a way to relate this construction to the classic Gamma-cat
egory construction for a bipermutative category. As an example, we use this machinery to construct a delooping of the K-theory of a bimonoidal category as defined by Baas-Dundas-Rognes.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
