News for hackers. Stuff that matters.
Re:Why Haskell is beyond ready for Prime Time by time_management on Thursday January 15, 2009 @12:00AM (#434837)
Monads aren't that hard. A monad is just like a burrito!

Pattern matching is awesome. It makes code immensely more readable.

Re:Why Haskell is beyond ready for Prime Time by silentbicycle on Thursday January 15, 2009 @07:50AM (#435101)
I started to understand monads when I compared the Maybe monad to the short-circuiting behavior of the Unix pipe. That doesn't mean my insight will work for anybody else, though.

Also, having masses of Haskell blog posts saying, "No, monads are actually not that hard, here's (an explanation that probably won't actually make all that much sense)." probably doesn't help to dispel the myth that Haskell is hard / impractical / whatever.

Re:Why Haskell is beyond ready for Prime Time by time_management on Thursday January 15, 2009 @08:59AM (#435128)
In understanding monads, I think Maybe and List are the best places to start, because they're familiar data structures. IO is conceptually familiar, but IO as an immutable value representing a series of actions is not.
Re:Why Haskell is beyond ready for Prime Time by silentbicycle on Thursday January 15, 2009 @01:21PM (#435451)
Agreed, strongly. Trying to understand monads in terms of IO makes things vastly more difficult than necessary.
Re:Why Haskell is beyond ready for Prime Time by time_management on Friday January 16, 2009 @12:25AM (#436191)
Well, just as "monads are like burritos", IO is like a delicious but sketchy fish taco. Eating is input. We shan't discuss the output process; we all know how it works and what it looks like. Food poisoning or poor health can lead to usage of standard error. In practice, stdout and stderr are usually redirected to the same buffer, which is flushed shortly after a write.
Re:Why Haskell is beyond ready for Prime Time by ighost on Monday February 02, 2009 @11:33PM (#463502)
brilliant.