The produoidal algebra of process decomposition
From MaRDI portal
Cites work
- (Co)end Calculus
- A categorical semantics for causal structure
- A mathematical theory of resources
- A new notation for arrows
- A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics
- Arrows, like monads, are monoids
- Categorical foundations of gradient-based learning
- Categorical quantum mechanics
- Commutativity
- Compositional game theory
- Concurrent Process Histories and Resource Transducers
- Disintegration and Bayesian inversion via string diagrams
- Duoidally enriched Freyd categories
- Dynamical systems and sheaves
- Generalising monads to arrows
- Graphical affine algebra
- Graphical Conjunctive Queries.
- scientific article; zbMATH DE number 3749236 (Why is no real title available?)
- Lenses, fibrations and universal translations
- Monads on higher monoidal categories
- Monoidal categories in, and linking, geometry and algebra
- Monoidal streams for dataflow programming
- Multiparty asynchronous session types
- Notions of computation and monads
- On closed categories of functors
- Open diagrams via coend calculus
- Polynomial functors. A mathematical theory of interaction
- Regular monoidal languages
- Restriction categories. I: Categories of partial maps
- Tannaka duality and convolution for duoidal categories
- The -calculus: A theory of mobile processes
- The geometry of tensor calculus. I
- The logic of message-passing
- Weakly distributive categories
- What are the fundamental structures of concurrency? We still don't know!
- Wiring diagrams as normal forms for computing in symmetric monoidal categories
Cited in
(2)
This page was built for publication: The produoidal algebra of process decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6856029)
