> 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?
Why are you so fixated on algorithms research in your attempts to dismiss the usefulness of functors and monads?
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.