Pith. sign in

REVIEW 2 major objections 10 minor 300 references

Convex biproducts turn additive matrix calculus into stochastic matrix calculus and give a complete axiomatisation of probabilistic Boolean circuits via tape diagrams.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.5

2026-07-31 20:50 UTC pith:YYEEJAEZ

load-bearing objection Solid free-construction paper that cleanly organises probabilistic tapes as stochastic matrices; one appendix lemma on normal-form invariance is under-written but almost certainly fixable. the 2 major comments →

arxiv 2607.24212 v1 pith:YYEEJAEZ submitted 2026-07-27 cs.LO math.CT

Convex Biproducts, Stochastic Matrices and Tape Diagrams

Filippo Bonchi , Cipriano Junior Cioffo This is my paper
classification cs.LO math.CT MSC 18M0518C1568Q5503G30
keywords convex biproductsstochastic matricestape diagramspointed convex algebrasprobabilistic Boolean circuitsrig categoriesKleisli categorycomplete axiomatisation
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Ordinary biproducts let you build matrices whose entries are arbitrary linear combinations. This paper introduces convex biproducts, which keep only the convex combinations that make sense for probabilities. The free convex biproduct category on a category C is then exactly the category of stochastic (or substochastic) matrices whose entries live in the free pointed-convex-algebra enrichment of C. When C is a category of string diagrams, that free construction is the category of probabilistic tape diagrams: outer wires encode the biproduct (disjoint union) while inner diagrams encode the monoidal product (cartesian product). The resulting isomorphism of rig categories supplies a concrete matrix semantics for tapes and, with three extra equational axioms, a sound and complete axiomatisation of probabilistic Boolean circuits with explicit conditioning. The same machinery also yields the first complete equational theory for partial Boolean circuits. A sympathetic reader cares because the construction gives a uniform, compositional algebra for probabilistic programs that sits between pure linear algebra and effectus theory, and because the completeness proof becomes a transparent calculation once the isomorphism is in hand.

Core claim

Categories with convex biproducts induce a matrix calculus of stochastic matrices, and the free such category on C is isomorphic to the category of stochastic matrices over the free pointed-convex-algebra enrichment of C; specialised to string diagrams this isomorphism identifies probabilistic tape diagrams with stochastic matrices of string-diagram subdistributions and yields a complete axiomatisation of probabilistic Boolean circuits.

What carries the argument

The composite free-construction functor T(−) ≅ StMat((−)+) from ordinary categories to convex biproduct categories (Corollary 5.6), which realises probabilistic tape diagrams as stochastic matrices and supplies the normal-form and cancellativity lemmas used for completeness.

Load-bearing premise

The characterisation of convex biproducts from monoids and co-pointed convex algebras needs an extra assumption that the two projections are jointly monic; without it the free constructions and the completeness transfer fail.

What would settle it

Exhibit a monoidal category with natural coherent monoids and co-pointed convex algebras whose projections are not jointly monic, yet which still satisfies the universal property of convex products; or find two distinct probabilistic Boolean circuits that the axioms of Figures 3, 5 and 6 equate but that denote different Kleisli arrows.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • Probabilistic tape diagrams receive a concrete stochastic-matrix semantics whose composition is ordinary matrix multiplication with convex sums.
  • Partial Boolean circuits admit a finite complete equational axiomatisation (Theorem 7.10), previously missing from the literature.
  • Adding the three tape axioms T1–T3 yields a complete axiomatisation of probabilistic Boolean circuits under the standard Kleisli semantics (Corollary 8.14).
  • The same free construction applies verbatim to any monoidal signature, giving a uniform matrix calculus for other probabilistic diagrammatic languages.
  • Convex biproduct categories sit strictly between ordinary biproduct categories and finitely partially additive categories, clarifying the algebraic gap with effectus theory.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The joint-monicity hypothesis suggests that cancellative models (free pcas, subdistribution monads) are the natural home of the theory; non-cancellative convex algebras may require a weaker universal property.
  • Extending the tapes with a uniform trace on the biproduct would immediately give a diagrammatic account of probabilistic regular expressions and submartingale invariants.
  • The matrix presentation makes automated equational reasoning for probabilistic circuits a matter of stochastic-matrix normalisation, which is algorithmically closer to existing linear-algebra tactics than to free-rig rewriting.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 10 minor

Summary. The paper introduces convex biproduct categories: PCA-enriched categories in which the coproduct also satisfies a 'convex product' universal property (unique mediating arrows for weighted families whose weights sum to at most 1). Main results: (i) the category StMat(C) of stochastic matrices over a PCA-enriched category C is the free convex biproduct category on C (Theorem 4.7); (ii) a syntactic construction T(C), freely adding natural monoids and co-pointed convex algebras, is left adjoint to the forgetful functor (Theorem 5.5), yielding T(C) isomorphic to StMat(C+) (Corollary 5.6); (iii) for categories of string diagrams this specializes to an isomorphism of rig categories between probabilistic tape diagrams and stochastic matrices of subdistributions of string diagrams (Corollary 6.2), with direct sum as ⊕ and an extended Kronecker product as ⊗; (iv) a complete axiomatization of partial Boolean circuits (Theorem 7.10); and (v) three tape axioms T1–T3 giving a sound and complete axiomatization for the KL(D≤)-semantics of probabilistic Boolean circuits with explicit conditioning (Corollaries 8.13–8.14). Section 9 compares with finitely partially additive categories.

Significance. If the results hold, the paper gives probabilistic tape diagrams a concrete matrix semantics — a robust tool for transferring axiomatizations, demonstrated by the completeness for probabilistic Boolean circuits, which strengthens [PTSZ25] by axiomatizing exact KL(D≤)-equality rather than equality up to a positive scalar. The completeness for partial Boolean circuits (Theorem 7.10) appears new and is independently useful. Strengths: explicit free constructions with adjunctions and long appendix proofs; a syntactic presentation of StMat(C+) by generators and equations; honest delimitation of the Fox analogue (Proposition 3.14) with the needed extra hypothesis clearly identified; and a counterexample (Example 9.3) showing freeness is essential in §9. The equational systems are concrete and falsifiable. My one substantive concern (Lemma F.7) is a missing well-definedness step whose repair appears routine using material already in the paper.

major comments (2)
  1. [Appendix F, Lemma F.7] The claimed bijection T(C)[U,V] ≅ D≤(C[U,V]) is only half-proved. The map is defined via the normal forms of Lemma F.6, which are produced by rewriting with the axioms of Tables 1–3 and (Tape); the proof shows distinct normal forms yield distinct subdistributions, but never shows the assignment is invariant under the axioms, i.e. that it descends to equivalence classes. As written, 'arrow ↦ subdistribution' is not well-defined on T(C). This is load-bearing: F.9→F.10→Lemma 5.2→5.3→Thm 5.4→Thm 5.5→Cor 5.6→6.2→Thm 8.12. F.9 also needs the bijection to be a pca morphism (to transfer cancellativity of D≤), likewise unshown. A standard repair is available in-paper: interpret terms inductively in StMat(C+); §4 (Lemmas 4.3–4.4, Prop 4.5, independent of §5) verifies Tables 1–3 and (Tape) there, so the interpretation descends to a PCA-enriched functor T(C)→StMat(C+); its homset action is the
  2. [Appendix F, Lemmas F.5–F.6–F.8] The three normal-form claims (F.5, F.6, F.8) are argued by sketch ('using naturality... one can move all occurrences'). Since the completeness of this rewriting with respect to the axioms of Tables 1–3 and (Tape) is exactly what the F.7 repair above must invoke, these lemmas should be proved against the explicit axiom list (e.g. by induction on terms), rather than by appeal to diagrammatic intuition. This is the same load-bearing node as the previous comment; I separate it only because the fix is independent: even with a well-defined interpretation, the normal-form coverage claims need rigorous justification.
minor comments (10)
  1. [§3.2] The structural isomorphisms are typed λ_X : 0⊕X→X and ρ_X : 0⊕X→X; one of the two should have domain X⊕0 (cf. their use in (3.3)–(3.4)).
  2. [§3.3, after Proposition 3.14] 'The converse does not hold: in a convex biproduct category, projections need not be jointly monic' is stated without a counterexample. Rel provides one: for X1=X2={0,1}, h={(a,(0,1)),(a,(1,0))} and g={(a,(0,0)),(a,(1,1))} satisfy h;πi=g;πi (i=1,2) but h≠g. One line would justify the extra hypothesis on which much of the paper rests.
  3. [Theorem 8.12] The statement gives I : T(DiagPB)∼ → StMat(KL(D≤)2), but the factorization diagram and proof in §8.3 use I : T(DiagPB)∼ → KL(D≤). Please harmonize statement and proof.
  4. [Definition 7.6 / Proposition 7.7] 'For all c ∈ DiagBP' (twice) should be DiagPB.
  5. [Table 2] Axiom (p◁-sym) reads 'p◁PσP,P = 1−p◁P'; the composition symbol is missing (p◁P;σP,P).
  6. [Equation (4.1)] The middle expression divides by r_ui, which may be 0; either state the 0/0 convention or present the rightmost form (via Lemma 2.2(3)) as the definition.
  7. [§9, proof of Lemma 9.4] The witnesses y″, x″, w′ in the associativity argument divide by total masses Σ_s y′(s) etc., which vanish for null subdistributions; the degenerate cases should be treated explicitly, as is done for well-definedness in Appendix J.
  8. [Abstract / §7.3] The abstract promises 'a complete axiomatisation of probabilistic Boolean circuits' without noting that [PTSZ25] axiomatized only equality up to a positive scalar (∝), while Corollary 8.14 axiomatizes exact KL(D≤)-equality. The strengthening is a selling point; state it in the abstract.
  9. [Corollary 6.2] No proof is given; one sentence (transport of ⊗ along the Corollary 5.6 isomorphism; compatibility with ⊕ via (6.4)) would suffice.
  10. [§1, equations (1.2)–(1.3)] The entries 0·⋆_{A,1} in (1.2)–(1.3) use the notation ⋆_{X,Y} before it is introduced in §2; a forward pointer would help the reader.

Circularity Check

1 steps flagged

No significant circularity: free constructions and completeness are self-contained relative to independent Kleisli semantics; self-citations are infrastructural.

specific steps
  1. self citation load bearing [§1 Introduction; §6; §8.1 (BCDGDL25)]
    "Importantly, when C is a category of string diagrams DiagΣ, T(DiagΣ) coincides with the category of probabilistic tape diagrams from [BCDGDL25]. ... In [BCDGDL25, Example 30], an encoding of probabilistic Boolean circuits into tape diagrams is presented."

    Prior work by overlapping authors supplies the tape syntax and the PrB→T(DiagPB) encoding used as the object of the completeness theorem. This is infrastructural self-citation, not a uniqueness/ansatz import that forces the main isomorphism or completeness by definition; the equational theory and faithfulness proof are developed in the present paper. Flagged only as minor, non-central self-citation.

full rationale

The central chain (adjunctions (−)+ ⊣ U, StMat(−) ⊣ U, T(−) ⊣ U; Cor. 5.6 T(C) ≅ StMat(C+); rig isomorphism Cor. 6.2; completeness Cor. 8.13/8.14) is ordinary free-construction and equational completeness relative to the independently defined category KL(D≤). Soundness checks axioms against that semantics; completeness factors through the free/matrix presentation and faithfulness of I, without fitting parameters or renaming a target quantity as a prediction. Self-citations (BCDGDL25 for tape syntax/encoding; conference precursors BC26a/b) supply infrastructure already used as the object of study, not a load-bearing uniqueness theorem that forbids alternatives. The skeptic’s concern about Lemma F.7 (bijection via normal forms) is a possible proof-gap/well-definedness issue under the axioms, not a circular reduction of a claimed prediction to its inputs: even if the appendix write-up is thin on axiom-invariance, that does not make Cor. 5.6 or completeness true by definition of the inputs. Score 1 only for routine author self-citation of the tape framework, which is not load-bearing in the circularity sense.

Axiom & Free-Parameter Ledger

0 free parameters · 7 axioms · 4 invented entities

Load-bearing background is standard monoidal category theory, pointed convex algebras, Kleisli categories of the subdistribution monad, and Fox’s theorem for biproducts. The paper’s own additions are the convex-product universal property, co-pca monoidal algebra, the jointly-monic side condition, and the three tape axioms used for probabilistic completeness. No numeric free parameters appear.

axioms (7)
  • standard math Pointed convex algebra laws (associativity, commutativity, idempotence of +_p with distinguished star) and PCA-enrichment of hom-sets (composition preserves +_p and star).
    Section 2; classical barycentric calculus / convex algebra background used for enrichment.
  • standard math Fox’s theorem: natural coherent commutative monoids in a symmetric monoidal category yield finite coproducts.
    Invoked throughout §3–5 to obtain coproducts from monoid structure on every object.
  • ad hoc to paper Convex product universal property: mediating arrows exist uniquely for weighted families with weights summing to ≤1.
    Definition 3.1; the defining new universal property of the paper.
  • ad hoc to paper Projections of the putative biproduct are jointly monic (extra hypothesis in the almost-Fox theorem).
    Proposition 3.14; needed because monoids+co-pcas alone do not force uniqueness of convex mediators.
  • domain assumption Cancellativity of the pca enrichment (and explicit tape axiom T3: p·t = p·s ⇒ t = s).
    Lemma 5.2 and Figure 6; used for jointly monic projections in T(C) and for completeness of probabilistic tapes.
  • domain assumption Boolean algebra and comonoid/Frobenius-style axioms for (partial) Boolean circuits, plus domain/total decomposition.
    Figures 3 and 5, Proposition 7.7; standard circuit equational theory extended by the paper’s partial axioms.
  • domain assumption Hom-sets are free pcas when relating convex biproducts to finitely partially additive categories.
    Section 9, Lemma 9.4 and Proposition 9.6; freeness is required for the induced partial sum to be a well-defined pcm.
invented entities (4)
  • Convex biproduct category / convex product independent evidence
    purpose: Abstract setting in which ⊕ is both coproduct and convex product, inducing substochastic matrix calculus.
    Core definitional contribution (Defs. 3.1, 3.5); independent evidence is the match with KL(D≤) and the free constructions.
  • Co-pointed convex algebra (co-pca) structure on objects independent evidence
    purpose: Dual algebraic structure supplying probabilistic splits p◁ and discard ⊸ as the convex counterpart of biproduct comonoids.
    Proposition 3.8 and Tables 1–2; standard dualisation of pcas in the monoidal setting of the paper.
  • StMat(C) category of stochastic matrices over a PCA-enriched category independent evidence
    purpose: Concrete free convex biproduct category; matrix multiplication uses convex sums and composition in C.
    Section 4; the free-object side of the right adjunction in (1.1).
  • Syntactic category T(C) of monoids and co-pcas (probabilistic tape diagrams when C = Diag) independent evidence
    purpose: Generators-and-equations presentation of the free convex biproduct category; graphical language for the completeness application.
    Section 5–6; isomorphic to StMat(C+) by Corollary 5.6.

pith-pipeline@v1.2.0-grok45-kimik3 · 73631 in / 3229 out tokens · 73791 ms · 2026-07-31T20:50:49.015161+00:00 · methodology

0 comments
read the original abstract

Categories with finite biproducts play a central role in category theory, providing an abstract setting in which additive and linear structures can be studied uniformly. In this paper, we introduce categories with \emph{convex} biproducts, which intuitively restrict the linear structures to convex ones. We show that, whereas categories with finite biproducts give rise to a matrix calculus based on arbitrary linear combinations, convex biproduct categories instead induce a matrix calculus based on stochastic (more generally, substochastic) matrices. This perspective yields a refined algebraic and compositional framework tailored to probabilistic settings. We exploit this connection to establish an isomorphism that underpins probabilistic tape diagrams, a graphical formalism for bimonoidal (also known as rig) categories, and we demonstrate its effectiveness by providing a complete axiomatisation of probabilistic Boolean circuits.

Figures

Figures reproduced from arXiv: 2607.24212 by Cipriano Junior Cioffo, Filippo Bonchi.

Figure 5
Figure 5. Figure 5: the equalities in the first row assert that [PITH_FULL_IMAGE:figures/full_fig_p024_5.png] view at source ↗
Figure 3
Figure 3. Figure 3: Now, in the case c; d, we have b Tc;d (7.4) =PB 0 n Dc;d Tc Td m m b (D5) =PB 0 Dc;d Tc Td m m b b Hp. =PB 0 Tc Td m m b 0 (D1) =PB 0 Tc Td m m b (D4) =PB 0 m . Finally, in the case c ⊗ d, since b =PB b1 ⊗ b2 for some b1 ∈ DiagB [1, A n ′ ] and b2 ∈ DiagB [1, A n ′′] such that n ′ + n ′′ = n, we have (7.4) =PB b Tc⊗d 0 Tc Td m m ′ Dc⊗d m ′ 0 m m m ′ b1 b2 (D5) =PB 0 Tc Td m m ′ Dc⊗d m ′ 0 m m m ′ b1 b2 b1 … view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

300 extracted references · 23 canonical work pages

  1. [1]

    Proceedings of the 37th International Conference on Concurrency Theory (CONCUR 2026) , year =

    Filippo Bonchi and Cipriano Junior Cioffo , title =. Proceedings of the 37th International Conference on Concurrency Theory (CONCUR 2026) , year =

    2026

  2. [2]

    Completeness for

    Filippo Bonchi and Cipriano Junior Cioffo , year=. Completeness for. 2606.19017 , archivePrefix=

    Pith/arXiv arXiv

  3. [3]

    2019 , school=

    Advanced weakest precondition calculi for probabilistic programs , author=. 2019 , school=

    2019

  4. [4]

    Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science , pages=

    Reasoning about recursive probabilistic programs , author=. Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science , pages=

  5. [5]

    UAI , year =

    Hoifung Poon and Pedro Domingos , title =. UAI , year =

  6. [6]

    UAI , year =

    Adnan Darwiche , title =. UAI , year =

  7. [7]

    Kschischang and Brendan J

    Frank R. Kschischang and Brendan J. Frey and Hans-Andrea Loeliger , title =. IEEE Transactions on Information Theory , volume =

  8. [8]

    Amar Hadzihasanovic , title =

  9. [9]

    New Journal of Physics , volume =

    Miriam Backens , title =. New Journal of Physics , volume =

  10. [10]

    Briegel , title =

    Robert Raussendorf and Hans J. Briegel , title =. Physical Review Letters , volume =

  11. [11]

    Journal of the ACM (JACM) , volume=

    The measurement calculus , author=. Journal of the ACM (JACM) , volume=. 2007 , publisher=

    2007

  12. [12]

    2009 , publisher=

    The space and motion of communicating agents , author=. 2009 , publisher=

    2009

  13. [13]

    Proceedings of the ACM on Programming Languages , volume=

    Quantitative program reasoning with graded modal types , author=. Proceedings of the ACM on Programming Languages , volume=. 2019 , publisher=

    2019

  14. [14]

    ACM SIGPLAN Notices , volume=

    Combining effects and coeffects via grading , author=. ACM SIGPLAN Notices , volume=. 2016 , publisher=

    2016

  15. [15]

    Tapes as Stochastic Matrices of String Diagrams

    Bonchi, Filippo and Cioffo, Cipriano Junior. Tapes as Stochastic Matrices of String Diagrams. Foundations of Software Science and Computation Structures. 2026

    2026

  16. [16]

    2026 , eprint=

    Tapes as Stochastic Matrices of String Diagrams , author=. 2026 , eprint=

    2026

  17. [17]

    Journal of Algebra , volume=

    Partially additive categories and flow-diagram semantics , author=. Journal of Algebra , volume=. 1980 , publisher=

    1980

  18. [18]

    arXiv preprint arXiv:1910.12198 , year=

    Effectuses in categorical quantum foundations , author=. arXiv preprint arXiv:1910.12198 , year=

    Pith/arXiv arXiv 1910

  19. [19]

    Categorical Aspects of Topology and Analysis: Proceedings of an International Conference Held at Carleton University, Ottawa, August 11--15, 1981 , pages=

    A categorical approach to probability theory , author=. Categorical Aspects of Topology and Analysis: Proceedings of an International Conference Held at Carleton University, Ottawa, August 11--15, 1981 , pages=. 2006 , organization=

    1981

  20. [20]

    A Completeness Theorem for Probabilistic Regular Expressions , booktitle =

    Wojciech Rozowski and Alexandra Silva , editor =. A Completeness Theorem for Probabilistic Regular Expressions , booktitle =. 2024 , url =. doi:10.1145/3661814.3662084 , timestamp =

    arXiv 2024

  21. [21]

    Filippo Bonchi and Ana Sokolova and Valeria Vignudelli , title =. Log. Methods Comput. Sci. , volume =. 2022 , url =. doi:10.46298/LMCS-18(2:21)2022 , timestamp =

    work page doi:10.46298/lmcs-18(2:21)2022 2022

  22. [22]

    36th Annual

    Matteo Mio and Ralph Sarkis and Valeria Vignudelli , title =. 36th Annual. 2021 , url =. doi:10.1109/LICS52264.2021.9470717 , timestamp =

    arXiv 2021

  23. [23]

    10th Conference on Algebra and Coalgebra in Computer Science,

    Weakly Markov categories and weakly affine monads , author=. 10th Conference on Algebra and Coalgebra in Computer Science,. 2023 , url =. doi:10.4230/LIPICS.CALCO.2023.16 , timestamp =

    work page doi:10.4230/lipics.calco.2023.16 2023

  24. [24]

    Journal of Machine Learning Research , volume=

    The d-separation criterion in categorical probability , author=. Journal of Machine Learning Research , volume=

  25. [25]

    IEEE Transactions on Information Theory , volume=

    Markov categories and entropy , author=. IEEE Transactions on Information Theory , volume=. 2023 , publisher=

    2023

  26. [26]

    Journal of the ACM , volume=

    Probabilistic programming with exact conditions , author=. Journal of the ACM , volume=. 2024 , publisher=

    2024

  27. [27]

    Electronic notes in theoretical computer science , volume=

    Bimonoidal structure of probability monads , author=. Electronic notes in theoretical computer science , volume=. 2018 , publisher=

    2018

  28. [28]

    Mathematical Structures in Computer Science , volume=

    Dilations and information flow axioms in categorical probability , author=. Mathematical Structures in Computer Science , volume=. 2023 , publisher=

    2023

  29. [29]

    Fritz, Tobias and Gonda, Tom. De. arXiv preprint arXiv:2105.02639 , year=

    Pith/arXiv arXiv

  30. [30]

    Ergodic Theory and Dynamical Systems , volume=

    A category-theoretic proof of the ergodic decomposition theorem , author=. Ergodic Theory and Dynamical Systems , volume=. 2023 , publisher=

    2023

  31. [31]

    2021 , publisher=

    The logical essentials of Bayesian reasoning , author=. 2021 , publisher=

    2021

  32. [32]

    International conference on foundations of software science and computation structures , pages=

    Causal inference by string diagram surgery , author=. International conference on foundations of software science and computation structures , pages=. 2019 , organization=

    2019

  33. [33]

    Mathematical Structures in Computer Science , volume=

    Disintegration and Bayesian inversion via string diagrams , author=. Mathematical Structures in Computer Science , volume=. 2019 , publisher=

    2019

  34. [34]

    arXiv preprint arXiv:0902.2554 , year=

    A presentation of the category of stochastic matrices , author=. arXiv preprint arXiv:0902.2554 , year=

    Pith/arXiv arXiv

  35. [35]

    Evidential Decision Theory via Partial Markov Categories , journal =

    Di Lavore, Elena and Rom. Evidential Decision Theory via Partial Markov Categories , journal =. 2023 , url =. doi:10.48550/ARXIV.2301.12989 , eprinttype =. 2301.12989 , timestamp =

    Pith/arXiv arXiv doi:10.48550/arxiv.2301.12989 2023

  36. [36]

    Partial Markov Categories , journal =

    Di Lavore, Elena and Rom. Partial Markov Categories , journal =. 2025 , url =. doi:10.48550/ARXIV.2502.03477 , eprinttype =. 2502.03477 , timestamp =

    doi:10.48550/arxiv.2502.03477 2025

  37. [37]

    Effectful Mealy Machines: Bisimulation and Trace , booktitle =

    Bonchi, Filippo and Di Lavore, Elena and Rom. Effectful Mealy Machines: Bisimulation and Trace , booktitle =. 2025 , url =. doi:10.1109/LICS65433.2025.00047 , timestamp =

    arXiv 2025

  38. [38]

    Panoramas et syntheses , volume=

    Categorical semantics of linear logic , author=. Panoramas et syntheses , volume=

  39. [39]

    (bo, ff) factorization system , howpublished =

  40. [40]

    Di Giorgio, Alessandro and Sobocinski, Pawel and Voorneveld, Niels , title =. 34th. 2026 , note =

    2026

  41. [41]

    Annali di Matematica Pura ed Applicata , volume=

    Postulates for the barycentric calculus , author=. Annali di Matematica Pura ed Applicata , volume=. 1949 , publisher=

    1949

  42. [42]

    Logical Methods in Computer Science , volume=

    Termination in convex sets of distributions , author=. Logical Methods in Computer Science , volume=. 2018 , publisher=

    2018

  43. [43]

    28th International Conference on Concurrency Theory (CONCUR 2017) , pages=

    The power of convex algebras , author=. 28th International Conference on Concurrency Theory (CONCUR 2017) , pages=. 2017 , organization=

    2017

  44. [44]

    11th Conference on Algebra and Coalgebra in Computer Science (CALCO 2025) , pages =

    Tape Diagrams for Monoidal Monads , author=. 11th Conference on Algebra and Coalgebra in Computer Science (CALCO 2025) , pages =. 2025 , volume =. doi:10.4230/LIPIcs.CALCO.2025.11 , annote =

    doi:10.4230/lipics.calco.2025.11 2025

  45. [45]

    Foundations of Software Science and Computation Structures

    Bonchi, Filippo and Di Giorgio, Alessandro and Di Lavore, Elena , title=. Foundations of Software Science and Computation Structures. 2025

    2025

  46. [46]

    , author=

    A categorical approach to linear logic, geometry of proofs and full completeness. , author=. 2000 , publisher=

    2000

  47. [47]

    Logical Methods in Computer Science , volume=

    Generic trace semantics via coinduction , author=. Logical Methods in Computer Science , volume=. 2007 , publisher=

    2007

  48. [48]

    Electronic Notes in Theoretical Computer Science , volume=

    From coalgebraic to monoidal traces , author=. Electronic Notes in Theoretical Computer Science , volume=. 2010 , publisher=

    2010

  49. [49]

    ArXiv , year=

    An Introduction to Effectus Theory , author=. ArXiv , year=

  50. [50]

    International Conference on Foundations of Software Science and Computation Structures , pages=

    Enriching diagrams with algebraic operations , author=. International Conference on Foundations of Software Science and Computation Structures , pages=. 2024 , organization=

    2024

  51. [51]

    Compositional Imprecise Probability:

    Jack Liell. Compositional Imprecise Probability:. Proc. 2025 , url =. doi:10.1145/3704890 , timestamp =

    doi:10.1145/3704890 2025

  52. [52]

    CoRR , volume =

    Ralph Sarkis and Fabio Zanasi , title =. CoRR , volume =. 2025 , url =. doi:10.48550/ARXIV.2501.18404 , eprinttype =. 2501.18404 , timestamp =

    work page doi:10.48550/arxiv.2501.18404 2025

  53. [53]

    Electronic Notes in Theoretical Computer Science , volume=

    Coalgebraic trace semantics for combined possibilitistic and probabilistic systems , author=. Electronic Notes in Theoretical Computer Science , volume=. 2008 , publisher=

    2008

  54. [54]

    2018 , issn =

    From probability monads to commutative effectuses , journal =. 2018 , issn =. doi:10.1016/j.jlamp.2016.11.006 , author =

    doi:10.1016/j.jlamp.2016.11.006 2018

  55. [55]

    Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science , pages=

    Combining probabilistic and non-deterministic choice via weak distributive laws , author=. Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science , pages=

  56. [56]

    Monadic functors and convexity , author=. Bull. Acad. Polon. Sci. S

  57. [57]

    Information and Computation , volume=

    Eilenberg--Moore algebras for stochastic relations , author=. Information and Computation , volume=. 2006 , publisher=

    2006

  58. [58]

    (No Title) , year=

    Monads and their Eilenberg-Moore algebras in functional analysis , author=. (No Title) , year=

  59. [59]

    IFIP International Conference on Theoretical Computer Science , pages=

    Convexity, duality and effects , author=. IFIP International Conference on Theoretical Computer Science , pages=. 2010 , organization=

    2010

  60. [60]

    Journal of Pure and Applied Algebra , volume=

    Introduction to extensive and distributive categories , author=. Journal of Pure and Applied Algebra , volume=. 1993 , publisher=

    1993

  61. [61]

    Mathematical aspects of natural and formal languages , pages=

    Feedback, iteration, and repetition , author=. Mathematical aspects of natural and formal languages , pages=. 1994 , publisher=

    1994

  62. [62]

    Ann Arbor , volume=

    A note on Bainbridge's power set construction , author=. Ann Arbor , volume=. 1998 , publisher=

    1998

  63. [63]

    Information and Control , volume=

    Feedback and generalized logic , author=. Information and Control , volume=. 1976 , publisher=

    1976

  64. [64]

    2015 , month = sep, number =

    Modular Categories as Representations of the 3-Dimensional Bordism 2-Category , author =. 2015 , month = sep, number =. doi:10.48550/arXiv.1509.06811 , archiveprefix =. 1509.06811 , eprinttype =

    Pith/arXiv arXiv doi:10.48550/arxiv.1509.06811 2015

  65. [65]

    The deterministic case , author=

    On flowchart theories Part I. The deterministic case , author=. Journal of Computer and System Sciences , volume=. 1987 , publisher=

    1987

  66. [66]

    The nondeterministic case , author=

    On flowchart theories: Part II. The nondeterministic case , author=. Theoretical Computer Science , volume=. 1987 , publisher=

    1987

  67. [67]

    Identities in iterative and rational algebraic theories , author=

  68. [68]

    Acclavio, Matteo , year =. Proof. Journal of Automated Reasoning , volume =. doi:10.1007/s10817-018-9466-4 , langid =

    work page doi:10.1007/s10817-018-9466-4

  69. [69]

    Functorial

    Melli. Functorial. Computer. 2006 , series =. doi:10.1007/11874683_1 , isbn =

    work page doi:10.1007/11874683_1 2006

  70. [70]

    , editor =

    Laplaza, Miguel L. , editor =. Coherence for Distributivity , booktitle =. 1972 , series =. doi:10.1007/BFb0059555 , isbn =

    doi:10.1007/bfb0059555 1972

  71. [71]

    , year =

    Mac Lane, S. , year =. Natural. Rice Institute Pamphlet - Rice University Studies , volume =

  72. [72]

    Categories for the

    Mac Lane, Saunders , year =. Categories for the

  73. [73]

    and Magnanti, Thomas L

    Ahuja, Ravindra K. and Magnanti, Thomas L. and Orlin, James B. , title =. 1993 , isbn =

    1993

  74. [74]

    CoRR , volume =

    Flavio Ascari and Roberto Bruni and Roberta Gori and Francesco Logozzo , title =. CoRR , volume =. 2023 , url =. doi:10.48550/ARXIV.2310.18156 , eprinttype =. 2310.18156 , timestamp =

    doi:10.48550/arxiv.2310.18156 2023

  75. [75]

    1993 , publisher=

    The formal semantics of programming languages: an introduction , author=. 1993 , publisher=

    1993

  76. [76]

    17th Annual Symposium on Foundations of Computer Science (sfcs 1976) , pages=

    Semantical considerations on Floyd-Hoare logic , author=. 17th Annual Symposium on Foundations of Computer Science (sfcs 1976) , pages=. 1976 , organization=

    1976

  77. [77]

    ACM Transactions on Programming Languages and Systems (TOPLAS) , volume=

    Kleene algebra with tests , author=. ACM Transactions on Programming Languages and Systems (TOPLAS) , volume=. 1997 , publisher=

    1997

  78. [78]

    Automatic Inference of Necessary Preconditions , booktitle =

    Patrick Cousot and Radhia Cousot and Manuel F. Automatic Inference of Necessary Preconditions , booktitle =. 2013 , url =. doi:10.1007/978-3-642-35873-9\_10 , timestamp =

    doi:10.1007/978-3-642-35873-9 2013

  79. [79]

    Proceedings of the ACM on Programming Languages , volume=

    Incorrectness logic , author=. Proceedings of the ACM on Programming Languages , volume=. 2019 , publisher=

    2019

  80. [80]

    Erkenntnis , volume=

    Mathematics, the empirical facts, and logical necessity , author=. Erkenntnis , volume=. 1983 , publisher=

    1983

Showing first 80 references.