User loginNavigation 
Question about the Monad associativity lawA really dump question... The associativity law states (using Haskell syntax): m >>= (\x > k x >>= h) = (m >>= k) >>= h What I don't understand is why "bind" can be associative. One use of monad is to encapsulate sideeffects. And the order of operations is important when there are sideeffects. If so, why does associativity hold? By sciomako at 20070911 03:58  LtU Forum  previous forum topic  next forum topic  other blogs  6539 reads

Browse archivesActive forum topics 
Recent comments
3 days 4 min ago
3 days 14 hours ago
3 days 17 hours ago
5 days 15 hours ago
5 days 16 hours ago
5 days 18 hours ago
6 days 1 hour ago
6 days 5 hours ago
6 days 8 hours ago
6 days 9 hours ago