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  6984 reads

Browse archivesActive forum topics 
Recent comments
1 hour 42 min ago
2 hours 15 min ago
2 hours 26 min ago
18 hours 12 min ago
21 hours 31 min ago
21 hours 48 min ago
1 day 2 hours ago
1 day 9 hours ago
1 day 15 hours ago
1 day 15 hours ago