No-go theorems for distributive laws
Monads are commonplace in computer science, and can be composed using Beck's distributive laws. Unfortunately, finding distributive laws can be extremely difficult and error-prone. The literature contains some principles for constructing distributive laws. However, until now there have been n...
Main Authors: | Zwart, M, Marsden, D |
---|---|
Format: | Conference item |
Published: |
IEEE
2019
|
Similar Items
-
No-Go Theorems for Distributive Laws
by: Maaike Zwart, et al.
Published: (2022-01-01) -
No-Go theorems and quantization
by: Zainuddin, Hishamuddin, et al.
Published: (2007) -
Causality and no-go theorems
by: Paolo Casella, et al.
Published: (2023-12-01) -
On the non-compositionality of monads via distributive laws
by: Zwart, M
Published: (2020) -
Parity violation in the scalar trispectrum: no-go theorems and yes-go examples
by: Giovanni Cabass, et al.
Published: (2023-02-01)