Weakening and iterating laws using string diagrams
From MaRDI portal
Cites work
- A list of successes that can change the world. Essays dedicated to Philip Wadler on the occasion of his 60th birthday
- Bialgebraic foundations for the operational semantics of string diagrams
- Bialgebraic semantics for logic programming
- Canonical automata via distributive law homomorphisms
- Combining probabilistic and non-deterministic choice via weak distributive laws
- Combining semilattices and semimodules
- Distributing probability over non-determinism
- Distribution bisimilarity via the power of convex algebras
- Equational reasoning with lollipops, forks, cups, caps, snakes, and speedometers
- Generalizing the powerset construction, coalgebraically
- scientific article; zbMATH DE number 2087441 (Why is no real title available?)
- scientific article; zbMATH DE number 7545241 (Why is no real title available?)
- scientific article; zbMATH DE number 3296291 (Why is no real title available?)
- Interacting Hopf algebras
- Iterated covariant powerset is not a monad
- Iterated distributive laws
- Lattices do not distribute over powerset
- Layer by layer -- combining monads
- Monad compositions II: Kleisli strength
- Monad compositions. I: General constructions and recursive distributive laws
- No-go theorems for distributive laws
- Notions of computation and monads
- On the 2-categories of weak distributive laws
- Picturing quantum processes. A first course in quantum theory and diagrammatic reasoning
- Product rules and distributive laws
- String diagram rewrite theory. I: Rewriting with Frobenius structure
- The geometry of tensor calculus. I
- The Vietoris monad and weak distributive laws
- The weak theory of monads
- Trace semantics via determinization
- Weak distributive laws
Cited in
(1)
This page was built for publication: Weakening and iterating laws using string diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6831514)
