Uniformly Traced Distributive Copy-Discard Categories

• The paper introduces a unified categorical framework combining copying, discarding, and trace with fixpoint operators to model imperative computation.
• It employs uniformly traced distributive multicategories integrating symmetric premonoidal composition and finite coproducts to derive various program logics.
• The framework models imperative constructs such as variable handling, control flow, and loop invariants, linking abstract theory with practical semantic models.

Searching arXiv for the specified paper and closely related context. Searching arXiv for "(Bonchi et al., 24 Jul 2025) Program Logics via Distributive Monoidal Categories" Uniformly traced distributive copy-discard categories are the categorical structures called imperative categories in "Program Logics via Distributive Monoidal Categories" (Bonchi et al., 24 Jul 2025). They are presented as a foundation for imperative computation and for deriving multiple program logics, including correctness, incorrectness, and relational Hoare logic, from a common algebraic base. In the paper’s formulation, the multicategorical core is a uniformly traced distributive multicategory equipped with copy-discard structure on unary morphisms; an imperative category is then an imperative multicategory with representable coproducts. The structure combines symmetric (pre)monoidal composition, finite coproducts and distributivity, cocommutative comonoids for copying and discarding, and a trace presented as a fixpoint operator. The resulting package is used to model variables, control flow, iteration, and loop invariants within a single denotational and proof-theoretic framework (Bonchi et al., 24 Jul 2025).

1. Base categorical structure

The paper works in the setting of strict symmetric premonoidal and monoidal categories. A strict premonoidal category is a category $C$ equipped with a sesquifunctor $\otimes : (C,C) \to C$ and a unit object $I$ such that, on objects,

$$A \otimes (B \otimes C) = (A \otimes B) \otimes C \quad\text{and}\quad A \otimes I = A = I \otimes A,$$

and on morphisms the tensor is separately associative and unital:

$$(f \otimes id_B)\otimes id_C = f \otimes (id_B \otimes id_C),$$

$$(id_A \otimes g)\otimes id_C = id_A \otimes (g \otimes id_C),$$

$$id_A \otimes (id_B \otimes h) = (id_A \otimes id_B)\otimes h,$$

$id_I \otimes f = f = f \otimes id_I.$

A morphism $f:A\to A'$ is central if for any $g:B\to B'$ the interchange axiom holds:

$\otimes : (C,C) \to C$0

A monoidal category is a premonoidal category in which all morphisms are central, and a symmetric premonoidal category has symmetries $\otimes : (C,C) \to C$1 satisfying the usual coherence equations.

This distinction between monoidal and premonoidal structure is operationally important in the paper. The internal language includes an interchange axiom that axiomatizes centrality on terms; with interchange one recovers monoidality, while dropping interchange models premonoidal effects. This gives the framework a direct connection to effect-sensitive semantics without altering the basic treatment of copying, branching, and looping.

2. Copy-discard and distributive structure

A copy-discard premonoidal category is a symmetric premonoidal category in which each object $\otimes : (C,C) \to C$2 carries a compatible and central cocommutative comonoid structure, given by a copy morphism $\otimes : (C,C) \to C$3 and a discard morphism $\otimes : (C,C) \to C$4. These satisfy coassociativity,

$\otimes : (C,C) \to C$5

cocommutativity,

$\otimes : (C,C) \to C$6

and counitality,

$\otimes : (C,C) \to C$7

They are also compatible with tensor and unit:

$\otimes : (C,C) \to C$8

$\otimes : (C,C) \to C$9

The paper defines a morphism $I$0 to be deterministic if it preserves copying,

$I$1

and total if it preserves discarding,

$I$2

These notions are used directly in the assignment and guard rules of the derived program logics.

A distributive copy-discard category is then a copy-discard category $I$3 with chosen finite coproducts, binary $I$4 and nullary $I$5, such that the canonical distributors are natural isomorphisms:

$I$6

$I$7

The paper assumes the natural coherence associated with Laplaza-style distributivity, and uses both binary coproducts and unbiased finite coproducts $I$8 with injections $I$9 and case maps.

Under the paper’s assumptions, copy and discard are compatible with coproducts. Writing $$A \otimes (B \otimes C) = (A \otimes B) \otimes C \quad\text{and}\quad A \otimes I = A = I \otimes A,$$0 for codiagonal, the paper gives:

$$A \otimes (B \otimes C) = (A \otimes B) \otimes C \quad\text{and}\quad A \otimes I = A = I \otimes A,$$1

and

$$A \otimes (B \otimes C) = (A \otimes B) \otimes C \quad\text{and}\quad A \otimes I = A = I \otimes A,$$2

It also records an inverse-distributor identity ensuring coherent interaction between tensor, coproduct, and copying. In particular, the structure maps of coproducts are total and deterministic (Bonchi et al., 24 Jul 2025).

The paper explicitly motivates this combination of axioms as a semantics of imperative computation. Copy-discard provides “variable wires,” distributivity and finite coproducts model guards and case analysis, and the distinction between deterministic and total morphisms gives precise hypotheses for assignment and branching principles.

3. Trace, fixpoint, and uniformity

The traced component is formulated multicategorically. Standard traced monoidal structure is recalled through a family

$$A \otimes (B \otimes C) = (A \otimes B) \otimes C \quad\text{and}\quad A \otimes I = A = I \otimes A,$$3

satisfying dinaturality, superposing, yanking, and vanishing. In the paper, however, trace is presented through a fixpoint operator on a traced distributive multicategory:

$$A \otimes (B \otimes C) = (A \otimes B) \otimes C \quad\text{and}\quad A \otimes I = A = I \otimes A,$$4

Its axioms are:

• morphism naturality:

$$A \otimes (B \otimes C) = (A \otimes B) \otimes C \quad\text{and}\quad A \otimes I = A = I \otimes A,$$5

• action naturality:

$$A \otimes (B \otimes C) = (A \otimes B) \otimes C \quad\text{and}\quad A \otimes I = A = I \otimes A,$$6

• strength:

$$A \otimes (B \otimes C) = (A \otimes B) \otimes C \quad\text{and}\quad A \otimes I = A = I \otimes A,$$7

• duplication:

$$A \otimes (B \otimes C) = (A \otimes B) \otimes C \quad\text{and}\quad A \otimes I = A = I \otimes A,$$8

• dinaturality:

$$A \otimes (B \otimes C) = (A \otimes B) \otimes C \quad\text{and}\quad A \otimes I = A = I \otimes A,$$9

These axioms encode the usual trace laws in the multicategorical setting. The paper states that yanking and superposing correspond to instances of strength and duplication, dinaturality is the sliding axiom, and vanishing corresponds to special cases of fix with units and empties under representability.

The distinctive additional principle is uniformity. A uniformly traced distributive multicategory, also called an Elgot multicategory in the paper, requires that if

$$(f \otimes id_B)\otimes id_C = f \otimes (id_B \otimes id_C),$$0

then

$$(f \otimes id_B)\otimes id_C = f \otimes (id_B \otimes id_C),$$1

The posetal form strengthens this to forward and backward inequalities: if the premise holds with $$(f \otimes id_B)\otimes id_C = f \otimes (id_B \otimes id_C),$$2, then the conclusion holds with $$(f \otimes id_B)\otimes id_C = f \otimes (id_B \otimes id_C),$$3, and if the premise holds with $$(f \otimes id_B)\otimes id_C = f \otimes (id_B \otimes id_C),$$4, then the conclusion holds with $$(f \otimes id_B)\otimes id_C = f \otimes (id_B \otimes id_C),$$5.

This posetal uniformity is central to the program-logic applications. The paper states that uniformity formalizes the proof principle that invariance under one unfolding step extends to invariance under the whole loop. In monoidal-categorical terms, its posetal version coincides with Hasegawa’s notion, expressed through the implication that existence of $$(f \otimes id_B)\otimes id_C = f \otimes (id_B \otimes id_C),$$6 such that

$$(f \otimes id_B)\otimes id_C = f \otimes (id_B \otimes id_C),$$7

implies

$$(f \otimes id_B)\otimes id_C = f \otimes (id_B \otimes id_C),$$8

with a dual formulation for the converse inequality (Bonchi et al., 24 Jul 2025).

4. Internal language and imperative constructs

The paper introduces an internal language for imperative multicategories. Its terms denote morphisms of the free traced distributive copy-discard multicategory, and its types are normalized polynomials, that is, sums of tensors of basic types. A context is written

$$(f \otimes id_B)\otimes id_C = f \otimes (id_B \otimes id_C),$$9

and an index

$$(id_A \otimes g)\otimes id_C = id_A \otimes (g \otimes id_C),$$0

where each label $$(id_A \otimes g)\otimes id_C = id_A \otimes (g \otimes id_C),$$1 names an exit together with its vector of variable types.

The primitive constructors are return, generator, and loop. Return takes a label in the index and variables in the context and forms a term $$(id_A \otimes g)\otimes id_C = id_A \otimes (g \otimes id_C),$$2. Generator applies a signature symbol

$$(id_A \otimes g)\otimes id_C = id_A \otimes (g \otimes id_C),$$3

to input variables, together with branch terms. Loop introduces a label and binds variables: if $$(id_A \otimes g)\otimes id_C = id_A \otimes (g \otimes id_C),$$4, then

$$(id_A \otimes g)\otimes id_C = id_A \otimes (g \otimes id_C),$$5

Three groups of equations organize the language. First, the interchange axiom expresses centrality of independent computations and recovers monoidality from premonoidal structure. Second, the loop axioms express dinaturality, diagonal behavior, and uniformity syntactically. Third, a fixpoint rule states that looping is a fixpoint for label substitution: if $$(id_A \otimes g)\otimes id_C = id_A \otimes (g \otimes id_C),$$6, then

$$(id_A \otimes g)\otimes id_C = id_A \otimes (g \otimes id_C),$$7

On top of this language, the paper derives combinators for guards, predicates, commands, and states. Guards $$(id_A \otimes g)\otimes id_C = id_A \otimes (g \otimes id_C),$$8 include left and right constants, negation, conjunction, disjunction, and a branch operator

$$(id_A \otimes g)\otimes id_C = id_A \otimes (g \otimes id_C),$$9

Predicates $$id_A \otimes (id_B \otimes h) = (id_A \otimes id_B)\otimes h,$$0 include

$$id_A \otimes (id_B \otimes h) = (id_A \otimes id_B)\otimes h,$$1

together with conjunction, conditional combination $$id_A \otimes (id_B \otimes h) = (id_A \otimes id_B)\otimes h,$$2, and the predicate associated to a guard,

$$id_A \otimes (id_B \otimes h) = (id_A \otimes id_B)\otimes h,$$3

Commands $$id_A \otimes (id_B \otimes h) = (id_A \otimes id_B)\otimes h,$$4 include skip, composition, assert, abort, assignment, generator assignment, conditional, and while. The key derived command forms are:

$$id_A \otimes (id_B \otimes h) = (id_A \otimes id_B)\otimes h,$$5

$$id_A \otimes (id_B \otimes h) = (id_A \otimes id_B)\otimes h,$$6

$$id_A \otimes (id_B \otimes h) = (id_A \otimes id_B)\otimes h,$$7

$$id_A \otimes (id_B \otimes h) = (id_A \otimes id_B)\otimes h,$$8

$$id_A \otimes (id_B \otimes h) = (id_A \otimes id_B)\otimes h,$$9

and

$id_I \otimes f = f = f \otimes id_I.$0

The paper records the loop unfolding equation

$id_I \otimes f = f = f \otimes id_I.$1

which is used repeatedly in the derived logics (Bonchi et al., 24 Jul 2025).

The denotational semantics theorem interprets every generator and term in any imperative multicategory using normalized coproducts and coactions of labels. Return uses finite-set opposite maps $id_I \otimes f = f = f \otimes id_I.$2 built from copy-discard structure, generator semantics threads inputs via $id_I \otimes f = f = f \otimes id_I.$3 and distributes branches via coactions, and loop semantics uses fixpoint to thread updated and non-updated variables. The paper states that this semantics is sound with respect to the language axioms and complete via the syntactic model.

5. Program logics derived from the axioms

The paper defines validity of triples through inequalities in the poset structure of a posetal imperative category. The basic forms are:

• state correctness: $id_I \otimes f = f = f \otimes id_I.$4;
• predicate correctness: $id_I \otimes f = f = f \otimes id_I.$5;
• assertion correctness: $id_I \otimes f = f = f \otimes id_I.$6;

together with their incorrectness variants obtained by replacing $id_I \otimes f = f = f \otimes id_I.$7 with $id_I \otimes f = f = f \otimes id_I.$8.

For Hoare logic, the paper proves that in any posetal imperative category with $id_I \otimes f = f = f \otimes id_I.$9 and $f:A\to A'$0 for all $f:A\to A'$1, the following rules are valid: skip, composition, assignment for deterministic and total expressions, choice, loop, unroll, deterministic-guard if-else, deterministic-guard while, monotonicity, conjunction, fail, assert-then, top, and bottom. The loop principle is especially direct: from

$f:A\to A'$2

infer

$f:A\to A'$3

For deterministic guards, the paper also derives

$f:A\to A'$4

The stated proof ingredients are interchange of predicates and guards, determinism and totality of guards, the definitions of predicates and commands, and posetal uniformity, which discharges loop invariants.

For incorrectness logic, valid rules include skip, composition, composition(error), assignment, non-deterministic assignment via sample, branch rules for the two sides of conditionals, convexity for constant guards, iteration rules, monotonicity, assert, fail, and bottom. The paper explicitly gives:

$f:A\to A'$5

and the iteration step

$f:A\to A'$6

For outcome-like logic, the paper proves analogous rules for predicates: skip, composition, deterministic assignment, sample, unroll, choice under total guards, if-else under total and deterministic guards, an assert rule, convexity for constant guards, monotonicity, and bottom.

The framework also yields relational program logics through couplings. A coupling of $f:A\to A'$7 and $f:A\to A'$8 is a morphism

$f:A\to A'$9

such that

$g:B\to B'$0

Strong couplings are those whose image lies in the first summand, and synchronization is obtained by following $g:B\to B'$1 with the map to that summand. A relational assertion-correctness triple $g:B\to B'$2 holds if there is a coupling with

$g:B\to B'$3

The paper derives relational Hoare logic rules for skip, composition, assignment, choice, if-else, loop, monotonicity, symmetry, and one-sided rules; it also gives a relational predicate-incorrectness logic formulated with $g:B\to B'$4 (Bonchi et al., 24 Jul 2025).

6. Models, semantics, and research context

The paper gives several concrete models:

• Set with the maybe monad: $g:B\to B'$5;
• Set with the powerset monad: $g:B\to B'$6;
• Set with the discrete subdistribution monad;
• Standard Borel spaces with the measurable subdistribution monad.

These are described as commutative strong monads over cartesian, hence copy-discard, base categories, yielding distributive (pre)monoidal Kleisli categories. Under partial additivity and $g:B\to B'$7-enrichment assumptions, the Kleisli categories have a uniform trace on coproducts by Jacobs’ theorem. The paper then proves posetal uniformity by adapting Hasuo’s generic trace theory: lax and oplax coalgebra morphisms yield the forward and backward inequalities, and therefore the trace is posetally uniform. Consequently, these Kleisli categories are posetal imperative categories.

The paper’s stated version of Jacobs’ theorem is: if $g:B\to B'$8 has countable coproducts, $g:B\to B'$9 is a partially additive monad, the Kleisli category $\otimes : (C,C) \to C$00 is $\otimes : (C,C) \to C$01-enriched, and cotuplings are monotone, then $\otimes : (C,C) \to C$02 has a uniform trace on its coproduct monoidal structure. Combined with commutative strength, this yields imperative categories. This places the abstract axioms in direct contact with standard semantic settings for partiality, relations, and probability.

The paper also provides string-diagram intuition. Return labels are coproduct injections, generator semantics is case analysis, and loop semantics is described through a fixpoint with a coalgebra to a final coalgebra $\otimes : (C,C) \to C$03, so that

$\otimes : (C,C) \to C$04

capturing “unfolding until exit.” Yanking, sliding, and superposing correspond to loop axioms; distributivity is depicted by wiring boxes across sums; and copy-discard appears as splitters and terminations for variable wires.

In relation to prior work, the paper places its fixpoint axioms in the lineage of Joyal–Street–Verity traced monoidal categories, extending Hasegawa-style uniformity to a posetal multicategorical setting. Its use of distributive categories relies on classical coherence in the sense of Laplaza. Its multicategorical presentation is aligned with cocartesian multicategories and colored Lawvere theories as used by Hermida, Curien, and Cartwright. Its treatment of premonoidal structure connects with Freyd-category and control semantics associated with Power, Robinson, Levy, and Heunen. The distinction between guards and predicates is explicitly compared with effectus theory, and the iteration principles are linked to Elgot and Arbib–Manes traced cocartesian semantics. A plausible implication is that the framework is designed as a unifying algebraic interface across relational, partial, and stochastic semantics while preserving the distinctions between guards and predicates and between correctness and incorrectness reasoning (Bonchi et al., 24 Jul 2025).