Timeline for tree derived from monad is itself a monad
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 23, 2015 at 13:02 | comment | added | greenTara | M is any monad, but my usecase comes from functional programming, so I am thinking in terms of monads on types. Either[A,B] is the functional programming way of representing the coproduct (i.e. disjoint sum) of A and B. N is an endofunctor constructed by composition. | |
| Mar 23, 2015 at 10:36 | answer | added | Maciej Piróg | timeline score: 3 | |
| Mar 20, 2015 at 18:58 | comment | added | Todd Trimble | I'm having trouble understanding the question. Is $M$ a monad on $Set$? What is the "usual 'or' bifunctor" -- is it disjoint sum? Is $N(A)$ supposed to be an initial algebra of the endofunctor $X \mapsto M[\text{Either}[A, X]]$? | |
| Mar 20, 2015 at 18:53 | review | First posts | |||
| Mar 20, 2015 at 19:13 | |||||
| Mar 20, 2015 at 18:52 | history | asked | greenTara | CC BY-SA 3.0 |