4 ms·

Lazyness requires monads for IO, but monads are useful for much more than IO, even in eager languages.

• tsimionescu 5y ago
  Absolutely, I meant "don't use them for IO", didn't mean to imply they are not used at all in other pure, strongly typed functional languages. I still think they don't often come up in algorithms research, though.
  • ebingdom 5y ago
    > I still think they don't often come up in algorithms research, though. Why are you so fixated on algorithms research in your attempts to dismiss the usefulness of functors and monads?
    • tsimionescu 5y ago
      You completely missed my purpose. The OP was claiming that Haskell is superior to some other programming languages because it "embraces computer science". I was pointing out that computer science is larger than PLL, and that much of computer science (algorithms research being a very productive field within CS) is not in fact using FP or PLL concepts to a large extent. Basically, I am only trying to dismiss the idea that Haskell is somehow closer to CS or more scientifically correct than other programming languages; instead, it is as related to CS as other languages are, just choosing to focus on a different area than many others. I also want to dismiss the idea that CS == FP, that imperative style reasoning is just some second-tier style not used in rigorous circles - much of the forefront of CS is indeed using imperative style constructs more than FP ones.