> Haskell provided a very light-weight syntax.
> Haskell allows partial-application of functions.
> Haskell allows definitions of unbounded data structures...
> Higher-order functions like "iterate" and "map"...
> Monads allowed me to avoid having to explicitly track side effects ... [also] purity and strong type checking.
> Libraries of higher order functions for monads allowed me to limit the syntactic cost of using monads.
Finally, the last point does not contradict the first. You can have lightweight syntax and use it to express heavyweight ideas. Then you can have libraries which help to alleviate that weight. This is a non-trivial task—it involves the abstraction power of your language and, in the case, the logical power of your type language.
If you're going to make an audacious claim then we need to see evidence to support that claim. The author didn't do this. All the author did was show us a Haskell implementation.
Not everything is a paper in Nature. I understand your point but he's honest about it just being a propaganda piece.
And, frankly, what's wrong with that?
Thanks to the author for taking the time to share.
That it doesn't solve OUR problem, which is "help us chose if Haskell if better", even though it pretends to?