Re:Haskell in the Large [pdf]
by gergoerdi on Thursday January 29, 2015 @02:57AM
(#8964877)
You can determine a lot more about a computation described only in terms of an applicative functor as you can from a monadic one, without running any of its effects (i.e. "statically").
It's easy to see why when you consider the opaqueness of the function in the right-hand side of a bind. Check out http://gergo.erdi.hu/blog/2012-12-01-static_analysis_with_ap... for an example.