Pith. sign in

REVIEW 2 major objections 10 minor 300 references

Convex Biproducts, Stochastic Matrices and Tape Diagrams

T0 review · 2 major / 10 minor · reviewed 2026-07-31 · grok-4.5

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

Pith's one-line read Convex biproducts turn additive matrix calculus into stochastic matrix calculus and give a complete axiomatisation of probabilistic Boolean circuits via tape diagrams.

desk verdict 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. read the letter →

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

Filippo Bonchi , Cipriano Junior Cioffo This is my paper · ORCID
classification cs.LOmath.CT MSC 18M0518C1568Q5503G30
keywords convexbiproductsstochasticmatricestapediagramspointedalgebrasprobabilisticBooleancircuitsrigcategoriesKleislicategorycompleteaxiomatisation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

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.

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.

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

Extended reading notes

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.

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.

Editorial extensions

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.

Reading between the lines

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.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, 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 · score 1.0 of 10

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

  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.

Assumptions & free parameters 0 free parameters · 7 assumptions · 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.

assumptions (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.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Convex Biproducts, Stochastic Matrices and Tape Diagrams." pith.science (2026). https://pith.science/paper/YYEEJAEZ

@misc{pith2026260724212,
  author       = {Pith},
  title        = {Pith review of: Convex Biproducts, Stochastic Matrices and Tape Diagrams},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/YYEEJAEZ}},
  note         = {Machine review of arXiv:2607.24212}
}
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 the authors.

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. 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 b2 (D1) =P… view at source ↗

Discussion (0). Continue with ORCID to comment.

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=

    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 =

Show all 300 references
  1. [9]

    New Journal of Physics , volume =

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

  2. [10]

    Briegel , title =

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

  3. [11]

    Journal of the ACM (JACM) , volume=

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

    2007

  4. [12]

    2009 , publisher=

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

    2009

  5. [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

  6. [14]

    ACM SIGPLAN Notices , volume=

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

    2016

  7. [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

  8. [16]

    2026 , eprint=

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

    2026

  9. [17]

    Journal of Algebra , volume=

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

    1980

  10. [18]

    arXiv preprint arXiv:1910.12198 , year=

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

    1910 arXiv

  11. [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

  12. [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 =

    2024

  13. [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 =

    2022 doi

  14. [22]

    36th Annual

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

    2021

  15. [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 =

    2023 doi

  16. [24]

    Journal of Machine Learning Research , volume=

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

  17. [25]

    IEEE Transactions on Information Theory , volume=

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

    2023

  18. [26]

    Journal of the ACM , volume=

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

    2024

  19. [27]

    Electronic notes in theoretical computer science , volume=

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

    2018

  20. [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

  21. [29]

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

    arXiv

  22. [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

  23. [31]

    2021 , publisher=

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

    2021

  24. [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

  25. [33]

    Mathematical Structures in Computer Science , volume=

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

    2019

  26. [34]

    arXiv preprint arXiv:0902.2554 , year=

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

    arXiv

  27. [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 =

    2023 doi arXiv

  28. [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 =

    2025 doi

  29. [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 =

    2025

  30. [38]

    Panoramas et syntheses , volume=

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

  31. [39]

    (bo, ff) factorization system , howpublished =

  32. [40]

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

    2026

  33. [41]

    Annali di Matematica Pura ed Applicata , volume=

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

    1949

  34. [42]

    Logical Methods in Computer Science , volume=

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

    2018

  35. [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

  36. [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 =

    2025 doi

  37. [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

  38. [46]

    , author=

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

    2000

  39. [47]

    Logical Methods in Computer Science , volume=

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

    2007

  40. [48]

    Electronic Notes in Theoretical Computer Science , volume=

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

    2010

  41. [49]

    ArXiv , year=

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

  42. [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

  43. [51]

    Compositional Imprecise Probability:

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

    2025 doi

  44. [52]

    CoRR , volume =

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

    2025 doi

  45. [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

  46. [54]

    2018 , issn =

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

    2018 doi

  47. [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=

  48. [56]

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

  49. [57]

    Information and Computation , volume=

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

    2006

  50. [58]

    (No Title) , year=

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

  51. [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

  52. [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

  53. [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

  54. [62]

    Ann Arbor , volume=

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

    1998

  55. [63]

    Information and Control , volume=

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

    1976

  56. [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 =

    2015 doi arXiv

  57. [65]

    The deterministic case , author=

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

    1987

  58. [66]

    The nondeterministic case , author=

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

    1987

  59. [67]

    Identities in iterative and rational algebraic theories , author=

  60. [68]

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

    doi

  61. [69]

    Functorial

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

    2006 doi

  62. [70]

    , editor =

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

    1972 doi

  63. [71]

    , year =

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

  64. [72]

    Categories for the

    Mac Lane, Saunders , year =. Categories for the

  65. [73]

    and Magnanti, Thomas L

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

    1993

  66. [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 =

    2023 doi

  67. [75]

    1993 , publisher=

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

    1993

  68. [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

  69. [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

  70. [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 =

    2013 doi

  71. [79]

    Proceedings of the ACM on Programming Languages , volume=

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

    2019

  72. [80]

    Erkenntnis , volume=

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

    1983

  73. [81]

    1888 , publisher=

    The nature and meaning of numbers , author=. 1888 , publisher=

  74. [82]

    Graphical

    Boisseau, Guillaume and Piedeleu, Robin , editor =. Graphical. Foundations of. 2022 , series =. doi:10.1007/978-3-030-99253-8_6 , isbn =

    2022 doi

  75. [83]

    arXiv preprint arXiv:2107.10526 , year=

    Bimonoidal Categories, E\_n -Monoidal Categories, and Algebraic K -Theory , author=. arXiv preprint arXiv:2107.10526 , year=

    arXiv

  76. [84]

    Electronic Notes in Theoretical Computer Science , volume=

    The uniformity principle on traced monoidal categories , author=. Electronic Notes in Theoretical Computer Science , volume=. 2003 , publisher=

    2003

  77. [85]

    Mathematical proceedings of the cambridge philosophical society , volume=

    Traced monoidal categories , author=. Mathematical proceedings of the cambridge philosophical society , volume=. 1996 , organization=

    1996

  78. [86]

    The Geometry of Tensor Calculus,

    Joyal, Andr. The Geometry of Tensor Calculus,. 1991 , month = jul, journal =. doi:10.1016/0001-8708(91)90003-P , langid =

    1991 doi

  79. [87]

    New structures for physics , pages=

    A survey of graphical languages for monoidal categories , author=. New structures for physics , pages=. 2010 , publisher=

    2010

  80. [88]

    1976 , journal =

    Coalgebras and Cartesian Categories , author =. 1976 , journal =

    1976

  81. [89]

    John , editor =

    Power, A. John , editor =. An Abstract Formulation for Rewrite Systems , booktitle =. 1989 , series =. doi:10.1007/BFb0018358 , isbn =

    1989 doi

  82. [90]

    1998 , publisher=

    Term rewriting and all that , author=. 1998 , publisher=

    1998

  83. [91]

    Rydeheard, D. E. and Burstall, R. M. , editor =. A Categorical Unification Algorithm , booktitle =. 1986 , series =. doi:10.1007/3-540-17162-2_139 , isbn =

    1986 doi

  84. [92]

    , editor =

    Goguen, Joseph A. , editor =. Algebraic. 1989 , month = jan, pages =. doi:10.1016/B978-0-12-046370-1.50012-7 , isbn =

    1989 doi

  85. [93]

    An interactive semantics of logic programming , volume=

    Bruni, Roberto and Montanari, Ugo and Rossi, Francesca , year=. An interactive semantics of logic programming , volume=. Theory and Practice of Logic Programming , publisher=. doi:10.1017/S1471068401000035 , number=

    doi

  86. [94]

    Knuth, D. E. and Bendix, P. B. , editor =. Simple. Automation of. 1983 , series =. doi:10.1007/978-3-642-81955-1_23 , isbn =

    1983 doi

  87. [95]

    Categorification, Term Rewriting and the

    Beke, Tibor , year =. Categorification, Term Rewriting and the. Journal of Pure and Applied Algebra , volume =. doi:10.1016/j.jpaa.2010.06.019 , langid =

    2010 doi

  88. [96]

    Coherence for Rewriting 2-Theories : General Theorems with Applications to Presentations of

    Cohen, Jonathan Asher , year =. Coherence for Rewriting 2-Theories : General Theorems with Applications to Presentations of

  89. [97]

    Characterizing Behavioural Congruences for

    Mogens Nielsen and Lutz Priese and Vladimiro Sassone , editor =. Characterizing Behavioural Congruences for. 1995 , url =. doi:10.1007/3-540-60218-6\_13 , timestamp =

    1995 doi

  90. [98]

    A Compositional Partial Order Semantics for

    Ekkart Kindler , editor =. A Compositional Partial Order Semantics for. Application and Theory of Petri Nets 1997, 18th International Conference,. 1997 , url =. doi:10.1007/3-540-63139-9\_39 , timestamp =

    1997 doi

  91. [99]

    Devillers and Jon G

    Eike Best and Raymond R. Devillers and Jon G. Hall , editor =. The box calculus: a new causal algebra with multi-label communication , booktitle =. 1992 , url =. doi:10.1007/3-540-55610-9\_167 , timestamp =

    1992 doi

  92. [100]

    Paolo Baldan and Andrea Corradini and Hartmut Ehrig and Reiko Heckel , title =. Math. Struct. Comput. Sci. , volume =. 2005 , url =. doi:10.1017/S0960129504004311 , timestamp =

    2005 doi

  93. [101]

    Petri nets based on

    Master, Jade , year=. Petri nets based on. Mathematical Structures in Computer Science , publisher=. doi:10.1017/s0960129520000262 , number=

    doi

  94. [102]

    Baez and Fabrizio Genovese and Jade Master and Michael Shulman , title =

    John C. Baez and Fabrizio Genovese and Jade Master and Michael Shulman , title =. CoRR , volume =. 2021 , url =

    2021

  95. [103]

    Baez and Jade Master , title =

    John C. Baez and Jade Master , title =. Math. Struct. Comput. Sci. , volume =. 2020 , url =. doi:10.1017/S0960129520000043 , timestamp =

    2020 doi

  96. [104]

    Bialgebraic Semantics for String Diagrams , booktitle =

    Filippo Bonchi and Robin Piedeleu and Pawel Sobocinski and Fabio Zanasi , editor =. Bialgebraic Semantics for String Diagrams , booktitle =. 2019 , url =. doi:10.4230/LIPIcs.CONCUR.2019.37 , timestamp =

    2019 doi

  97. [105]

    27th EACSL Annual Conference on Computer Science Logic (CSL 2018) , pages =

    Filippo Bonchi and Jens Seeber and Pawel Sobocinski , title =. 27th EACSL Annual Conference on Computer Science Logic (CSL 2018) , pages =. 2018 , volume =. doi:10.4230/LIPIcs.CSL.2018.13 , annote =

    2018 doi

  98. [106]

    Proceedings of the ninth annual ACM symposium on Theory of computing , pages=

    Optimal implementation of conjunctive queries in relational data bases , author=. Proceedings of the ninth annual ACM symposium on Theory of computing , pages=

  99. [107]

    String Diagrams for Regular Logic (Extended Abstract) , booktitle=

    Fong, Brendan and Spivak, David , year=. String Diagrams for Regular Logic (Extended Abstract) , booktitle=. doi:10.4204/eptcs.323.14 , series=

    doi

  100. [108]

    Diagrammatic Algebra: From Linear to Concurrent Systems , shorttitle =

    Bonchi, Filippo and Holland, Joshua and Piedeleu, Robin and Soboci. Diagrammatic Algebra: From Linear to Concurrent Systems , shorttitle =. 2019 , month = jan, journal =

    2019

  101. [109]

    Compositional Diagrammatic First-Order Logic , booktitle =

    Nathan Haydon and Pawe. Compositional Diagrammatic First-Order Logic , booktitle =

  102. [110]

    Piedeleu, Robin and Zanasi, Fabio , editor =. A. Foundations of. 2021 , series =. doi:10.1007/978-3-030-71995-1_24 , isbn =

    2021 doi

  103. [111]

    Shannon , title =

    Claude E. Shannon , title =. 1942 , timestamp =

    1942

  104. [112]

    Discrete, Continuous, and Hybrid Petri Nets , username =

    David, Ren\'. Discrete, Continuous, and Hybrid Petri Nets , username =. doi:10.1007/978-3-642-10669-9 , edition = 2, file =

    doi

  105. [113]

    Contextual Equivalence for Signal Flow Graphs , booktitle =

    Filippo Bonchi and Robin Piedeleu and Pawel Sobocinski and Fabio Zanasi , editor =. Contextual Equivalence for Signal Flow Graphs , booktitle =. 2020 , doi =

    2020

  106. [114]

    Proceedings of the 2nd international

    Martin Hyland and John Power , title =. Proceedings of the 2nd international. 2000 , doi =

    2000

  107. [115]

    Bonsangue and Helle Hvid Hansen and Jan Rutten , title =

    Henning Basold and Marcello M. Bonsangue and Helle Hvid Hansen and Jan Rutten , title =. Essays Dedicated to Prakash Panangaden on the Occasion of His 60th Birthday , series =. 2014 , doi =

    2014

  108. [116]

    EATCS Monographs on Theoretical Computer Science , publisher=

    Iteration theories: The equational logic of iterative processes , author=. EATCS Monographs on Theoretical Computer Science , publisher=

  109. [117]

    and Jung, Achim , booktitle=

    Ghica, Dan R. and Jung, Achim , booktitle=. Categorical semantics of digital circuits , year=

  110. [118]

    Ghica and Aliaume Lopez , title =

    Dan R. Ghica and Aliaume Lopez , title =. Proceedings 14th International Conference on Quantum Physics and Logic (

  111. [119]

    Ghica , title =

    Dan R. Ghica , title =. Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky , publisher =. 2013 , pages =

    2013

  112. [120]

    Pillars of computer science , pages=

    Finite dimensional vector spaces are complete for traced symmetric monoidal categories , author=. Pillars of computer science , pages=. 2008 , publisher=

    2008

  113. [121]

    Logical Methods in Computer Science , volume=

    Finite dimensional Hilbert spaces are complete for dagger compact closed categories , author=. Logical Methods in Computer Science , volume=. 2012 , publisher=

    2012

  114. [122]

    Diagrammatic Differentiation for Quantum Machine Learning , booktitle =

    Alexis Toumi and Richie Yeung and Giovanni de Felice , editor =. Diagrammatic Differentiation for Quantum Machine Learning , booktitle =. 2021 , url =. doi:10.4204/EPTCS.343.7 , timestamp =

    2021 doi

  115. [123]

    Quantum , volume=

    Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus , author=. Quantum , volume=. 2021 , publisher=

    2021

  116. [124]

    Bulletin of the American Physical Society , year=

    Diagrammatic Analysis for Parameterized Quantum Circuits , author=. Bulletin of the American Physical Society , year=

  117. [125]

    Proceedings of the 35th international colloquium on Automata, Languages and Programming (ICALP), Part II , pages=

    Interacting Quantum Observables , author=. Proceedings of the 35th international colloquium on Automata, Languages and Programming (ICALP), Part II , pages=

  118. [126]

    Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning , DOI=

    Coecke, Bob and Kissinger, Aleks , year=. Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning , DOI=

  119. [127]

    European Symposium on Programming , pages=

    Concurrent Kleene algebra: Free model and completeness , author=. European Symposium on Programming , pages=. 2018 , organization=

    2018

  120. [128]

    Preprint , year=

    Orthomodularity in dagger biproduct categories , author=. Preprint , year=

  121. [129]

    The Journal of Logic and Algebraic Programming , volume=

    Concurrent Kleene algebra and its foundations , author=. The Journal of Logic and Algebraic Programming , volume=. 2011 , publisher=

    2011

  122. [130]

    Acta Informatica , volume =

    Paolo Baldan and Fabio Gadducci , title =. Acta Informatica , volume =. 2019 , url =. doi:10.1007/s00236-018-0314-0 , timestamp =

    2019 doi

  123. [131]

    1980 , author =

    A Calculus of Communicating Systems , publisher =. 1980 , author =

    1980

  124. [132]

    Communications of the ACM , volume=

    An axiomatic basis for computer programming , author=. Communications of the ACM , volume=. 1969 , publisher=

    1969

  125. [133]

    Theoretical Computer Science , year =

    Kohei Honda and Nobuko Yoshida , title =. Theoretical Computer Science , year =

  126. [134]

    Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP) , pages=

    Barbed Bisimulation , author=. Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP) , pages=

  127. [135]

    Theoretical Computer Science , volume=

    Call-by-name, call-by-value and the -calculus , author=. Theoretical Computer Science , volume=. 1975 , publisher=

    1975

  128. [136]

    Theoretical Computer Science , volume=

    Testing equivalences for processes , author=. Theoretical Computer Science , volume=. 1984 , publisher=

    1984

  129. [137]

    , author=

    Lambda-calculus models of programming languages. , author=. 1969 , school=

    1969

  130. [138]

    Graphical Affine Algebra , booktitle =

    Filippo Bonchi and Robin Piedeleu and Pawe. Graphical Affine Algebra , booktitle =

  131. [139]

    2019 , url =

    34th Annual. 2019 , url =

    2019

  132. [140]

    Baez, Brandon Coya, Franciscus Rebro , title =

    John C. Baez, Brandon Coya, Franciscus Rebro , title =. CoRR , volume =. 2017 , url =

    2017

  133. [141]

    CoRR , volume =

    Bart Jacobs and Fabio Zanasi , title =. CoRR , volume =. 2018 , url =

    2018

  134. [142]

    Bart Jacobs and Fabio Zanasi , title =. Electr. Notes Theor. Comput. Sci. , volume =. 2016 , url =. doi:10.1016/j.entcs.2016.09.038 , timestamp =

    2016 doi

  135. [143]

    B. Fong. Causal Theories: A Categorical Perspective on Bayesian Networks. 2012

    2012

  136. [144]

    Some Algebraic Laws for Spans (and Their Connections With Multi-Relations) , Year =

    Roberto Bruni and Fabio Gadducci , Booktitle =. Some Algebraic Laws for Spans (and Their Connections With Multi-Relations) , Year =

  137. [145]

    arXiv preprint arXiv:1711.08699 , year =

    Bonchi, Filippo and Pavlovic, Dusko and Sobocinski, Pawel , title =. arXiv preprint arXiv:1711.08699 , year =

    arXiv

  138. [146]

    Math.\ Struct.\ Comp.\ Sci

    Bob Coecke and Dusko Pavlovic and Jamie Vicary , title =. Math.\ Struct.\ Comp.\ Sci. , year =

  139. [147]

    Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , volume =

    Leonard Eugene Dickson , journal =. Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , volume =

  140. [148]

    Connector algebras,

    Bruni, Roberto and Melgratti, Hern. Connector algebras,. International Andrei Ershov Memorial Conference on Perspectives of System Informatics , pages=. 2011 , organization=

    2011

  141. [149]

    International Workshop on Algebraic Development Techniques , pages=

    Tiles for reo , author=. International Workshop on Algebraic Development Techniques , pages=. 2008 , organization=

    2008

  142. [150]

    A Decade of Concurrency, Reflections and Perspectives,

    Mogens Nielsen and Vladimiro Sassone and Glynn Winskel , title =. A Decade of Concurrency, Reflections and Perspectives,. 1993 , url =. doi:10.1007/3-540-58043-3\_25 , timestamp =

    1993 doi

  143. [151]

    Refinement for Signal Flow Graphs , booktitle =

    Filippo Bonchi and Joshua Holland and Dusko Pavlovic and Pawe. Refinement for Signal Flow Graphs , booktitle =. 2017 , url =. doi:10.4230/LIPIcs.CONCUR.2017.24 , timestamp =

    2017 doi

  144. [152]

    Kelly and A.J

    G.M. Kelly and A.J. Power. Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads. Journal of Pure and Applied Algebra. 1993. doi:https://doi.org/10.1016/0022-4049(93)90092-8

    1993 doi

  145. [153]

    Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads

    Marina Lenisa and John Power and Hiroshi Watanabe. Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. Electronic Notes in Theoretical Computer Science. 2000

    2000

  146. [154]

    Information and Computation , volume =

    Filippo Bonchi and Pawel Sobocinski and Fabio Zanasi , title =. Information and Computation , volume =

  147. [155]

    Electronic Notes in Theoretical Computer Science , volume=

    The Algebra of Partial Equivalence Relations , author=. Electronic Notes in Theoretical Computer Science , volume=

  148. [156]

    On Bicategories of Relations and Pullback Spans , Volume =

    Jeanne Meisen , Date-Added =. On Bicategories of Relations and Pullback Spans , Volume =. Communications in Algebra , Number =

  149. [157]

    Theory and Applications of Categories , Title =

    Coya, B and Brendan Fong , Date-Added =. Theory and Applications of Categories , Title =

  150. [158]

    The Algebra of Open and Interconnected Systems , Year =

    Brendan Fong , Date-Added =. The Algebra of Open and Interconnected Systems , Year =

  151. [159]

    Circuits, Bond Graphs, and Signal-Flow Diagrams: A Categorical Perspective , Year =

    Brandon Coya , School =. Circuits, Bond Graphs, and Signal-Flow Diagrams: A Categorical Perspective , Year =

  152. [160]

    Picturing Resources in Concurrency , Year =

    Robin Piedeleu , School =. Picturing Resources in Concurrency , Year =

  153. [161]

    A compositional framework for Markov processes , Volume =

    Baez, John and Brendan Fong and Pollard, B , Date-Added =. A compositional framework for Markov processes , Volume =. Journal of Mathematical Physics , Number =

  154. [162]

    Lectures on categorical quantum mechanics , Year =

    Chris Heunen and Jamie Vicary , Date-Modified =. Lectures on categorical quantum mechanics , Year =

  155. [163]

    Data types as lattices , Year =

    Scott, Dana , Booktitle =. Data types as lattices , Year =

  156. [164]

    Generic commutative separable algebras and cospans of graphs , Volume =

    Rosebrugh, Robert and Sabadini, Nicoletta and Walters, RFC , Journal =. Generic commutative separable algebras and cospans of graphs , Volume =

  157. [165]

    Syntax for Split Preorders , Volume =

    Kosta Do. Syntax for Split Preorders , Volume =. Annals of Pure and Applied Logic , Number =

  158. [166]

    Matrices, relations, and group representations , Volume =

    Aurelio Carboni , Journal =. Matrices, relations, and group representations , Volume =

  159. [167]

    Rewriting modulo symmetric monoidal structure , Volume =

    Filippo Bonchi and Fabio Gadducci and Aleks Kissinger and Pawel Sobocinski and Fabio Zanasi , Bibsource =. Rewriting modulo symmetric monoidal structure , Volume =. CoRR , Timestamp =

  160. [168]

    Hypergraph Rewriting: Critical Pairs and Undecidability of Confluence , Year =

    Plump, Detlef , Booktitle =. Hypergraph Rewriting: Critical Pairs and Undecidability of Confluence , Year =

  161. [169]

    and Kissinger,A

    Dixon,L. and Kissinger,A. , Date-Modified =. Open-graphs and monoidal theories , Volume =. Mathematical Structures in Computer Science , Month =. 2013 , Bdsk-Url-1 =

    2013

  162. [170]

    Quantum Groups , Year =

    Kassel, Christian , Publisher =. Quantum Groups , Year =

  163. [171]

    and Nipkow, T

    Baader, F. and Nipkow, T. , Publisher =. Term rewriting and all that , Year =

  164. [172]

    Deriving Bisimulation Congruences in the

    Hartmut Ehrig and Barbara K\". Deriving Bisimulation Congruences in the

  165. [173]

    Sesqui-Pushout Rewriting , Volume =

    Corradini, Andrea and Heindel, Tobias and Hermann, Frank and K\". Sesqui-Pushout Rewriting , Volume =. Graph Transformations , Language =

  166. [174]

    Higher categories, strings, cubes and simplex equations , Volume =

    Ross Street , Journal =. Higher categories, strings, cubes and simplex equations , Volume =

  167. [175]

    Towards 3-Dimensional Rewriting Theory , Volume =

    Samuel Mimram , Bibsource =. Towards 3-Dimensional Rewriting Theory , Volume =. Logical Methods in Computer Science , Number =. 2014 , Bdsk-Url-1 =

    2014

  168. [176]

    Termination orders for 3-dimensional rewriting , Volume =

    Yves Guiraud , Bibsource =. Termination orders for 3-dimensional rewriting , Volume =. CoRR , Timestamp =

  169. [177]

    Interacting Hopf Algebras: the theory of linear systems , Year =

    Fabio Zanasi , Pages =. Interacting Hopf Algebras: the theory of linear systems , Year =

  170. [178]

    R. F. C. Walters , Howpublished =. The tensor product of matrices , Year =

  171. [179]

    Limits indexed by category-valued 2-functors , Volume =

    Ross Street , Journal =. Limits indexed by category-valued 2-functors , Volume =

  172. [180]

    Adhesive and quasiadhesive categories , Volume =

    Stephen Lack and Pawe. Adhesive and quasiadhesive categories , Volume =. Theoretical Informatics and Applications , Number =

  173. [181]

    Parallelism of manipulations in information structures , Year =

    Hartmut Ehrig and Hans-J\". Parallelism of manipulations in information structures , Year =. MFCS 1976 , Pages =

    1976

  174. [182]

    Reactive systems over cospans , Year =

    Vladimiro Sassone and Pawe. Reactive systems over cospans , Year =

  175. [183]

    An inductive view of graph transformation , Year =

    Fabio Gadducci and Reiko Heckel , Booktitle =. An inductive view of graph transformation , Year =

  176. [184]

    LICS 2016 , Title =

    Brendan Fong and Paolo Rapisarda and Pawe. LICS 2016 , Title =

    2016

  177. [185]

    Strong Complementarity and Non-locality in Categorical Quantum Mechanics , Year =

    Bob Coecke and Ross Duncan and Aleks Kissinger and Quanlong Wang , Booktitle =. Strong Complementarity and Non-locality in Categorical Quantum Mechanics , Year =

  178. [186]

    Compositional Reachability in

    Julian Rathke and Pawe. Compositional Reachability in. RP 2014 , Pages =

    2014

  179. [187]

    Reachability via Compositionality in

    Pawe. Reachability via Compositionality in. Submitted to ICALP`13 , Note =

  180. [188]

    International Symposium on Formal Methods for Components and Objects , pages=

    Synchronised hyperedge replacement as a model for service oriented computing , author=. International Symposium on Formal Methods for Components and Objects , pages=. 2005 , organization=

    2005

  181. [189]

    A Programming Language for Spatial Distribution of Net Systems , Year =

    Pawe. A Programming Language for Spatial Distribution of Net Systems , Year =. Petri Nets 2014 , Pages =

    2014

  182. [190]

    Jose Meseguer and Ugo Montanari , Journal =

  183. [191]

    , author=

    Algebraic Approaches to Graph Transformation-Part I: Basic Concepts and Double Pushout Approach. , author=. 1997 , publisher=

    1997

  184. [192]

    Amalgamations of categories , Volume =

    John MacDonald and Laura Scull , Journal =. Amalgamations of categories , Volume =

  185. [193]

    Robert Rosebrugh and Nicoletta Sabadini and R. F. C. Walters , Journal =. Generic Commutative Separable Algebras and Cospans of Graphs , Volume =

  186. [194]

    Symmetric monoidal sketches , Year =

    Martin Hyland and John Power , Booktitle =. Symmetric monoidal sketches , Year =

  187. [195]

    The structure of first-order causality , Volume =

    Mimram, Samuel , Issn =. The structure of first-order causality , Volume =. Mathematical Structures in Computer Science , Month =

  188. [196]

    and Panangaden, Prakash and Winskel, Glynn , Issn =

    Hildebrandt, Thomas T. and Panangaden, Prakash and Winskel, Glynn , Issn =. A Relational Model of Non-deterministic Dataflow , Volume =. Mathematical. Structures in Comp. Sci. , Month = oct, Number =

  189. [197]

    A Non-Standard Semantics for

    Romain Beauxis and Samuel Mimram , Booktitle =. A Non-Standard Semantics for

  190. [198]

    Presenting Finite Posets , Volume =

    Mimram, Samuel , Booktitle =. Presenting Finite Posets , Volume =

  191. [199]

    Semantique des jeux asynchrones et r\'

    Samuel Mimram , Pages =. Semantique des jeux asynchrones et r\'

  192. [200]

    Pierre Rannou , Pages =. R\'

  193. [201]

    Orbifold completion of defect bicategories , Volume =

    Nils Carqueville and Ingo Runkel , Journal =. Orbifold completion of defect bicategories , Volume =

  194. [202]

    Coalgebraic Derivations in Logic Programming , Volume =

    Ekaterina Komendantskaya and John Power , Bibsource =. Coalgebraic Derivations in Logic Programming , Volume =. CSL , Ee =

  195. [203]

    Expressiveness of Monadic Second Order Logics on Infinite Trees of Arbitrary Branching Degree , Year =

    Fabio Zanasi , School =. Expressiveness of Monadic Second Order Logics on Infinite Trees of Arbitrary Branching Degree , Year =

  196. [204]

    A Characterization Theorem for the Alternation-Free Fragment of the Modal

    Alessandro Facchini and Yde Venema and Fabio Zanasi , Bibsource =. A Characterization Theorem for the Alternation-Free Fragment of the Modal. 28th Annual. 2013 , Bdsk-Url-1 =

    2013

  197. [205]

    ACM SIGPLAN Notices , volume=

    Full abstraction for signal flow graphs , author=. ACM SIGPLAN Notices , volume=. 2015 , publisher=

    2015

  198. [206]

    How to Kill Epsilons with a Dagger -

    Filippo Bonchi and Stefan Milius and Alexandra Silva and Fabio Zanasi , Bibsource =. How to Kill Epsilons with a Dagger -. Coalgebraic Methods in Computer Science - 12th. 2014 , Bdsk-Url-1 =

    2014

  199. [207]

    Saturated Semantics for Coalgebraic Logic Programming , Year =

    Filippo Bonchi and Fabio Zanasi , Bibsource =. Saturated Semantics for Coalgebraic Logic Programming , Year =. Algebra and Coalgebra in Computer Science - 5th International Conference,

  200. [208]

    Facundo Carreiro and Alessandro Facchini and Yde Venema and Fabio Zanasi , Bibsource =. Weak. Joint Meeting of the Twenty-Third. 2014 , Bdsk-Url-1 =

    2014

  201. [209]

    Killing Epsilons with a Dagger --- A Coalgebraic Study of Systems with Algebraic Label Structure , Year =

    Filippo Bonchi and Stefan Milius and Alexandra Silva and Fabio Zanasi , Journal =. Killing Epsilons with a Dagger --- A Coalgebraic Study of Systems with Algebraic Label Structure , Year =

  202. [210]

    Logical Methods in Computer Science , Title =

    Filippo Bonchi and Fabio Zanasi , Issue =. Logical Methods in Computer Science , Title =

  203. [211]

    Parametric corecursion and completely iterative monads

    Ad\'. Parametric corecursion and completely iterative monads. , Volume =. FICS , Date =

  204. [212]

    , Isbn =

    Stefanescu, G. , Isbn =. Network Algebra , Year =

  205. [213]

    1997 , school=

    Models of Sharing Graphs: A Categorical Semantics of let and letrec , author=. 1997 , school=

    1997

  206. [214]

    Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi , Year =

    Masahito Hasegawa , Pages =. Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi , Year =

  207. [215]

    An Algebraic Presentation of Term Graphs, via

    Andrea Corradini and Fabio Gadducci , Journal =. An Algebraic Presentation of Term Graphs, via

  208. [216]

    Term Graph Rewriting: Theory and Practice , Year =

  209. [217]

    PI-Calculus: A Theory of Mobile Processes , Year =

    Sangiorgi, Davide and Walker, David , Isbn =. PI-Calculus: A Theory of Mobile Processes , Year =

  210. [218]

    , Isbn =

    Milner, R. , Isbn =. A Calculus of Communicating Systems , Year =

  211. [219]

    , Date-Modified =

    Peterson, James L. , Date-Modified =. ACM Comput. Surv. , Month = sep, Number =. 1977 , Bdsk-Url-1 =

    1977

  212. [220]

    Hoare, C. A. R. , Date-Modified =. Communicating Sequential Processes , Volume =. Commun. ACM , Keywords =. 1978 , Bdsk-Url-1 =

    1978

  213. [221]

    A Synthetic Approach to

    Fritz, Tobias , journal=. A Synthetic Approach to. 2020 , eprinttype =. 1908.07021 , publisher=

    2020 arXiv

  214. [222]

    2014 , note =

    Freyd categories are Enriched Lawvere Theories , journal =. 2014 , note =. doi:10.1016/j.entcs.2014.02.010 , author =

    2014 doi

  215. [223]

    Probabilistic relations , Year =

    Panangaden, Prakash , Journal =. Probabilistic relations , Year =

  216. [224]

    A presentation of the category of stochastic matrices , Volume =

    Tobias Fritz , Journal =. A presentation of the category of stochastic matrices , Volume =

  217. [225]

    The ZX-calculus is complete for the single-qubit Clifford+T group , Volume =

    Backens, Miriam , Booktitle =. The ZX-calculus is complete for the single-qubit Clifford+T group , Volume =. 2014 , Bdsk-Url-1 =

    2014

  218. [226]

    The ZX-calculus is complete for stabilizer quantum mechanics , Volume =

    Miriam Backens , Journal =. The ZX-calculus is complete for stabilizer quantum mechanics , Volume =

  219. [227]

    Christian Schr. The. Proceedings of the 11th workshop on Quantum Physics and Logic,. 2014 , Bdsk-Url-1 =

    2014

  220. [228]

    2003 , publisher=

    Fibonacci?s Liber Abaci: a translation into modern English of Leonardo Pisano?s book of calculation , author=. 2003 , publisher=

    2003

  221. [229]

    Communications of the ACM , volume=

    Flow diagrams, Turing machines and languages with only two formation rules , author=. Communications of the ACM , volume=. 1966 , publisher=

    1966

  222. [230]

    Combinatorial mathematics and its applications , volume=

    Applications of negative dimensional tensors , author=. Combinatorial mathematics and its applications , volume=

  223. [231]

    Drawing Theories Apart , year=

    Drawing theories apart , author=. Drawing Theories Apart , year=

  224. [232]

    On the Positive Calculus of Relations with Transitive Closure , booktitle =

    Damien Pous , editor =. On the Positive Calculus of Relations with Transitive Closure , booktitle =. 2018 , url =. doi:10.4230/LIPIcs.STACS.2018.3 , timestamp =

    2018 doi

  225. [233]

    Algebra Universalis , volume=

    Axiomatizability of reducts of algebras of relations , author=. Algebra Universalis , volume=. 2000 , publisher=

    2000

  226. [234]

    Journal of Pure and Applied Algebra , volume=

    Towards an algebraic theory of boolean circuits , author=. Journal of Pure and Applied Algebra , volume=. 2003 , publisher=

    2003

  227. [235]

    Stephen Brookes , Title =

  228. [236]

    Willems , Booktitle =

    J.C. Willems , Booktitle =. Linear systems in discrete time , Year =

  229. [237]

    Quantomatic:

    Aleks Kissinger and Vladimir Zamdzhiev , Bibsource =. Quantomatic:. CoRR , Timestamp =

  230. [238]

    and Escard\'

    Pavlovic, D. and Escard\'. Calculus in Coinductive Form , Year =. Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science , Isbn =

  231. [239]

    , Booktitle =

    Penrose, R. , Booktitle =

  232. [240]

    Equational reasoning with 2-dimensional diagrams , Volume =

    Lafont, Yves , Booktitle =. Equational reasoning with 2-dimensional diagrams , Volume =. 1995 , Bdsk-Url-1 =

    1995

  233. [241]

    Linear Logic , Volume =

    Jean. Linear Logic , Volume =. Theor. Comput. Sci. , Pages =. 1987 , Bdsk-Url-1 =

    1987

  234. [242]

    The structure of multiplicatives , Volume =

    Danos, Vincent and Regnier, Laurent , Date-Modified =. The structure of multiplicatives , Volume =. Archive for Mathematical Logic , Language =. 1989 , Bdsk-Url-1 =

    1989

  235. [243]

    Interaction Nets , Year =

    Yves Lafont , Bibsource =. Interaction Nets , Year =. Conference Record of the Seventeenth Annual

  236. [244]

    Interaction Combinators , Volume =

    Yves Lafont , Bibsource =. Interaction Combinators , Volume =. Inf. Comput. , Number =. 1997 , Bdsk-Url-1 =

    1997

  237. [245]

    Jan J. M. M. Rutten , Bibsource =. Rational Streams Coalgebraically , Volume =. Logical Methods in Computer Science , Number =. 2008 , Bdsk-Url-1 =

    2008

  238. [246]

    Higher operads, higher categories , Year =

    Leinster, Tom , Number =. Higher operads, higher categories , Year =

  239. [247]

    Distributive laws , Volume =

    Beck, Jon , Booktitle =. Distributive laws , Volume =. 1969 , Bdsk-Url-1 =

    1969

  240. [248]

    Burris, Stanley and Sankappanavar, H. P. , File =

  241. [249]

    Bonsangue and Helle Hvid Hansen and Alexander Kurz and Jurriaan Rot , Bibsource =

    Marcello M. Bonsangue and Helle Hvid Hansen and Alexander Kurz and Jurriaan Rot , Bibsource =. Presenting Distributive Laws , Year =. Algebra and Coalgebra in Computer Science - 5th International Conference,

  242. [250]

    CoRR , Title =

    Abramsky, Samson and Coecke, Bob , Ee =. CoRR , Title =

  243. [251]

    Matrices, relations, and group representations , Volume =

    Aurelio Carboni , Date-Modified =. Matrices, relations, and group representations , Volume =. Journal of Algebra , Number =. 1991 , Bdsk-Url-1 =

    1991

  244. [252]

    Traced monoidal categories , Volume =

    Joyal,Andr. Traced monoidal categories , Volume =. Math Procs Cambridge Philosophical Society , Month =

  245. [253]

    Lawvere theories and monads , Year =

    Hyland, Martin and Power, John , Booktitle =. Lawvere theories and monads , Year =

  246. [254]

    Lawvere, F. W. , year =. Functorial

  247. [255]

    Closed categories , Year =

    Eilenberg, Samuel and Kelly, G Max , Booktitle =. Closed categories , Year =

  248. [256]

    Two-Dimensional Topological Quantum Field Theories And Frobenius Algebras , Volume =

    Lowell Abrams , Journal =. Two-Dimensional Topological Quantum Field Theories And Frobenius Algebras , Volume =

  249. [257]

    Lectures on axiomatic topological quantum field theory , Year =

    Quinn, Frank , Journal =. Lectures on axiomatic topological quantum field theory , Year =

  250. [258]

    Teimuraz Pirashvili , Journal =. On the

  251. [259]

    CoRR , Title =

    Wadsley, Simon and Woods, Nick , Date-Modified =. CoRR , Title =. 2015 , Bdsk-Url-1 =

    2015

  252. [260]

    Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science (LICS) , pages=

    A Sound and Complete Calculus for Finite Stream Circuits , author=. Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science (LICS) , pages=

    2010

  253. [261]

    Bonsangue and Jan J

    Filippo Bonchi and Marcello M. Bonsangue and Jan J. M. M. Rutten and Alexandra Silva , Bibsource =. Deriving Syntax and Axioms for Quantitative Regular Behaviours , Year =

  254. [262]

    2013 , publisher=

    Categories for the working mathematician , author=. 2013 , publisher=

    2013

  255. [263]

    2023 , MONTH = Feb, KEYWORDS =

    Robin Piedeleu and Fabio Zanasi , URL =. 2023 , MONTH = Feb, KEYWORDS =. doi:10.46298/lmcs-19(1:13)2023 , JOURNAL =

    2023 doi

  256. [264]

    A Complete Axiomatisation of Equivalence for Discrete Probabilistic Programming , booktitle =

    Piedeleu, Robin and Torres. A Complete Axiomatisation of Equivalence for Discrete Probabilistic Programming , booktitle =. 2025 , url =. doi:10.1007/978-3-031-91121-7\_9 , timestamp =

    2025 doi

  257. [265]

    Bonsangue and Jan J

    Marcello M. Bonsangue and Jan J. M. M. Rutten and Alexandra Silva , Bibsource =. Coalgebraic Logic and Synthesis of Mealy Machines , Year =. Foundations of Software Science and Computational Structures, 11th International Conference,

  258. [266]

    A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events , Volume =

    Dexter Kozen , Journal =. A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events , Volume =

  259. [267]

    Kleene, S. C. , Biburl =. Automata Studies , Editor =

  260. [268]

    Bergman , Journal =

    G. Bergman , Journal =. Everybody knows what a

  261. [269]

    Sweedler , Publisher =

    M. Sweedler , Publisher =

  262. [270]

    New Directions in Categorical Logic, for Classical, Probabilistic and Quantum Logic , Volume =

    Bart Jacobs , Bibsource =. New Directions in Categorical Logic, for Classical, Probabilistic and Quantum Logic , Volume =. CoRR , Timestamp =. 2012 , Bdsk-Url-1 =

    2012

  263. [271]

    Tobias Heindel and Pawel Sobocinski , Bibsource =. Being. Logical Methods in Computer Science , Number =. 2011 , Bdsk-Url-1 =

    2011

  264. [272]

    Hogben, Leslie , Edition =

  265. [273]

    Hopf Algebras , Volume = 235, Year =

    Dascalescu, Sorin and Nastasescu, Constantin and Raianu, Serban , Isbn =. Hopf Algebras , Volume = 235, Year =

  266. [274]

    Coherence for compact closed categories , Volume =

    Kelly, Gregory M and Laplaza, Miguel L , Journal =. Coherence for compact closed categories , Volume =

  267. [275]

    Handbook of Categorical Algebra 1 -- Basic Category Theory , Username =

    Borceux, Francis , Biburl =. Handbook of Categorical Algebra 1 -- Basic Category Theory , Username =

  268. [276]

    Semantics of Higher-Order Quantum Computation via Geometry of Interaction , Year =

    Ichiro Hasuo and Naohiko Hoshino , Bibsource =. Semantics of Higher-Order Quantum Computation via Geometry of Interaction , Year =. Proceedings of the 26th Annual

  269. [277]

    Coreflections in Algebraic Quantum Logic , Volume =

    Jacobs, Bart and Mandemaker, Jorik , Date-Modified =. Coreflections in Algebraic Quantum Logic , Volume =. Foundations of Physics , Keywords =. 2012 , Bdsk-Url-1 =

    2012

  270. [278]

    Semantics of type theory : correctness, completeness, and independence results , Year = 1991, Bdsk-Url-1 =

    Streicher, Thomas , Date-Modified =. Semantics of type theory : correctness, completeness, and independence results , Year = 1991, Bdsk-Url-1 =

    1991

  271. [279]

    Jacobs , Number =

    B. Jacobs , Number =. Categorical Logic and Type Theory , Year =

  272. [280]

    Introduction to bicategories , Volume =

    B\'. Introduction to bicategories , Volume =. Reports of the Midwest Category Seminar , Language =

  273. [281]

    Theoretical Computer Science , volume=

    A basic algebra of stateless connectors , author=. Theoretical Computer Science , volume=. 2006 , publisher=

    2006

  274. [282]

    Distributive laws for Lawvere Theories , Year =

    Eugenia Cheng , Journal =. Distributive laws for Lawvere Theories , Year =

  275. [283]

    Baez and Mike Stay , Journal =

    John C. Baez and Mike Stay , Journal =. Physics, Topology, Logic and Computation: A Rosetta Stone , Volume =

  276. [284]

    Memoryful geometry of interaction: from coalgebraic components to algebraic effects , author=. Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Scien...

    2014

  277. [285]

    Journal of Pure and Applied Algebra , volume=

    Bicategories of processes , author=. Journal of Pure and Applied Algebra , volume=. 1997 , publisher=

    1997

  278. [286]

    RAIRO-Theoretical Informatics and Applications , volume=

    Feedback, trace and fixed-point semantics , author=. RAIRO-Theoretical Informatics and Applications , volume=

  279. [287]

    Piergiulio Katis and Nicoletta Sabadini and Robert Frank Carslaw Walters , Booktitle =

  280. [288]

    On the notion of cause , Volume =

    Bertrand Russell , Journal =. On the notion of cause , Volume =

  281. [289]

    Bonchi, Filippo and Sobocinski, Pawel and Zanasi, Fabio , year =. Full. Proceedings of the 42nd. doi:10.1145/2676726.2676993 , isbn =

  282. [290]

    Proceedings of the 25th International Conference on Concurrency Theory (CONCUR) , pages=

    A categorical semantics of signal flow graphs , author=. Proceedings of the 25th International Conference on Concurrency Theory (CONCUR) , pages=. 2014 , organization=

    2014

  283. [291]

    CoRR , Title =

    Samson Abramsky , Bibsource =. CoRR , Title =

  284. [292]

    Plotkin and Daniele Terreni , Journal =

    Roberto Bruni and Ugo Montanari and Gordon D. Plotkin and Daniele Terreni , Journal =. On Hierarchical Graphs: Reconciling Bigraphs, Gs-monoidal Theories and Gs-graphs , Volume =

  285. [293]

    Ghica , Bibsource =

    Dan R. Ghica , Bibsource =. Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits , Year =. Abramsky Festschrift , Ee =

  286. [294]

    Monoidal computer

    Dusko Pavlovic , Bibsource =. Monoidal computer. Information and Computation , Pages =

  287. [295]

    Monoidal computer

    Pavlovic, Dusko , journal=. Monoidal computer

  288. [296]

    Categories In Control , Volume =

    Baez, John and Erbele, Jason , Date-Modified =. Categories In Control , Volume =. Theory and Applications of Categories , Pages =

  289. [297]

    2014 , Bdsk-Url-1 =

    Basold, Henning and Bonsangue, Marcello and Hansen, HelleHvid and Rutten, Jan , Booktitle =. 2014 , Bdsk-Url-1 =

    2014

  290. [298]

    LICS , Isbn =

    Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, 11-14 July 2010, Edinburgh, United Kingdom , Year =. LICS , Isbn =

    2010

  291. [299]

    Christel Baier and Marjan Sirjani and Farhad Arbab and Jan J. M. M. Rutten , Bibsource =. Modeling component connectors in. Sci. Comput. Prog. , Number =

  292. [300]

    , Publisher =

    Lahti, B.P. , Publisher =. Signal Processing and Linear Systems , Year =

Pith tools

Reviewed July 31, 2026 · model on record in the stance chip above.