@dibblego foldMap (Sum &&& Sum . const 1) >>> join (***) getSum >>> uncurry (/)
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@techtangents Snap! I previously had: sum &&& genericLength >>> uncurry (/). My new idea is to do it with one list traversal /cc@dibblegoThanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@techtangents@dibblego Yes, could be. I had a revelation when I realised that a pair of monoids is a monoid. HT http://channel9.msdn.com/Shows/Going+Deep/C9-Lectures-Dr-Ralf-Lmmel-Going-Bananas …Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@techtangents you could enjoy this "join" trick too i.e. bimap fromIntegral fromIntegral === join bimap fromIntegral. Not sure how it works!Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@dibblego fromIntegral . sum / fromIntegral . lengthThanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@dibblego Wait, this is from so long ago! I guess somebody else replying made it show up again.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@techtangents thanks, that was a nice exposition — really easy to follow. I still don't have an good intuition about it yet though…Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@techtangents this is the one I have little intuition for i.e. that the join operation of reader monad will "duplicate" a fn applicationThanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.