Table of Contents
Fetching ...

Monoidal categories graded by partial commutative monoids

Matthew Earnshaw, Chad Nester, Mario Román

Abstract

Effectful categories have two classes of morphisms: pure morphisms, which form a monoidal category; and effectful morphisms, which can only be combined monoidally with central morphisms (such as the pure ones), forming a premonoidal category. This suggests seeing morphisms of an effectful category as carrying a grade that combines under the monoidal product in a partially defined manner. We axiomatize this idea with the notion of monoidal category graded by a partial commutative monoid (PCM). Monoidal categories arise as the special case of grading by the singleton PCM, and effectful categories arise from grading by a two-element PCM. Further examples include grading by powerset PCMs, modelling non-interfering parallelism for programs accessing shared resources, and grading by intervals, modelling bounded resource usage. We show that effectful categories form a coreflective subcategory of PCM-graded monoidal categories; introduce cartesian structure, recovering Freyd categories; and describe PCM-graded monoidal categories as monoids by viewing a PCM as a thin promonoidal category.

Monoidal categories graded by partial commutative monoids

Abstract

Effectful categories have two classes of morphisms: pure morphisms, which form a monoidal category; and effectful morphisms, which can only be combined monoidally with central morphisms (such as the pure ones), forming a premonoidal category. This suggests seeing morphisms of an effectful category as carrying a grade that combines under the monoidal product in a partially defined manner. We axiomatize this idea with the notion of monoidal category graded by a partial commutative monoid (PCM). Monoidal categories arise as the special case of grading by the singleton PCM, and effectful categories arise from grading by a two-element PCM. Further examples include grading by powerset PCMs, modelling non-interfering parallelism for programs accessing shared resources, and grading by intervals, modelling bounded resource usage. We show that effectful categories form a coreflective subcategory of PCM-graded monoidal categories; introduce cartesian structure, recovering Freyd categories; and describe PCM-graded monoidal categories as monoids by viewing a PCM as a thin promonoidal category.
Paper Structure (22 sections, 25 theorems, 47 equations)

This paper contains 22 sections, 25 theorems, 47 equations.

Key Result

Lemma 2.5

For every element $b$ of a PCM $(E, \oplus, 0)$, the operations $(- \oplus b)$ are monotonic with respect to the "extension preorder": $x \leqslant y$ and $y \perp b$ implies $x \perp b$ and $x \oplus b \leqslant y \oplus b$.

Theorems & Definitions (78)

  • Definition 2.1
  • Definition 2.2
  • Definition 2.3
  • Definition 2.4
  • Lemma 2.5
  • Example 2.6
  • Example 2.7
  • Example 2.8
  • Definition 2.9
  • Definition 2.10
  • ...and 68 more