I think there's a tendency for FP purists to exaggerate the brokenness of software. Most people have lower standards. But perfect purity is the only position from which anyone can claim the absence of certain classes of bugs... and they do.
I didn't think so, but I don't really know Haskell well enough. You could certainly "fork" an immutable value, but I think only one instance of it could survive when it gets sequenced into a side-effecting monad... But I'm out of my depth here...
-
-
Sorry, I should have formed a question rather than an assertion. So the compiler figures out that the same state may be derived simultaneously (say in a comprehension) and uses a sequenced execution monad to prevent that?
-
If so, how does it decide which execution should be first, second, third, etc? Rule of code order in the comprehension?
- Show replies
New conversation -
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.