Haskell makes some array access operations cumbersome due to syntactic issues with the library's API. It is not inherent that Haskell's quickSort is harder tha

Haskell makes some array access operations cumbersome due to syntactic issues with the library's API. It is not inherent that Haskell's quickSort is harder than quickSort in C. Take a look at Augustusson's imperative language DSLs in Haskell: http://augustss.blogspot.com/2011/07/impredicative-polymorphism-use-case-in.html http://augustss.blogspot.com/2011/07/impredicative-polymorph... Haskell is so versatile at this, augustusson managed to implement an old BASIC DSL! http://augustss.blogspot.com/2009/02/more-basic-not-that-anybody-should-care.html http://augustss.blogspot.com/2009/02/more-basic-not-that-any... I think Haskell can be a great vehicle for all our current day imperative programming needs (even if due to some library issues it's not quite as nice for all tasks yet).