Timeline for Is there any math foundation for map/reduce?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 20, 2012 at 1:50 | comment | added | Vlad Patryshev | Hmm. the discussion by the first link is about "generalized monad", Haskell style. While it is probably feasible to split the notion into two functors, declaring the second one a monad, I'd stay away from the arbitrariness of programming thinking and hold to a more mathematical interpretation. As to the second paper, monads are not even mentioned there. Instead, as expected, it talks about monoids being used for reduction; and duly so. More, it defines the monoid on Map type that is being used in map/reduce, thus answering my question. | |
| Dec 26, 2011 at 4:01 | vote | accept | Vlad Patryshev | ||
| Dec 18, 2011 at 5:31 | comment | added | François G. Dorais | Merci beaucoup Jacques! | |
| Dec 18, 2011 at 2:19 | history | answered | Jacques Carette | CC BY-SA 3.0 |