Knuth, predicting "a monad is a monoid in the category of endofunctors":pic.twitter.com/yGL0Iul2DQ
Show this thread
-
This Tweet is unavailable.
-
This Tweet is unavailable.
-
This Tweet is unavailable.
But, it's easy to write pure functions in any language?? It's not that Haskell makes that easier, it's that it makes the state part harder. Which is not really appreciated when state is necessary, which it very much is.
-
-
Can make something like statics in Java or C# if you really need to with Haskell's version of unsafe code, but it is often not needed. I think another way to think about it is that Hs is easier to use if you think about the edge cases and limitations of your algorithm earlier on.
-
I've implemented a compiler and language runtime and a bunch of computationally very demanding stuff in Hs after many years of C++/C#, and it enabled me to handle so much more complexity than I could in those other languages. Purity is only one puzzle piece of that.
- Show replies
New conversation -
-
-
At work I wish we had a way to -enforce- purity in PL/SQL library functions. It would be so much easier if you could see whether a func can modify memory beyond its own and only use other pure funcs or not. Only depending on discipline to stick to convention has its limits there.
Thanks. 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.