Though it does not often get mentioned in the Haskell community, simply
bumping to a new version of GHC can drastically improve the performance of your
code. Here, I have several examples from my
package, which will hopefully give an idea of just how much work has gone into
optimizing code produced by GHC.
Below, I have collected several examples of "uncanny" Haskell. These are things that may be surprising to those who have learned the language merely by doing.
Initially, I had written
hackage-fetch to see if there was
any use of
anywhere on Hackage. At the time, there was not, but this has changed due
gmpint package. As of
writing, it is not surprisingly the only use of co-(Elgot algebra)s on the entirety of Hackage.
You may have seen my post on co-(Elgot algebras),
in which I mentioned I had been using some exotic recursion schemes for my
gmpint package. I came across a similar example, this time for Mendler-style
recursion schemes. To my knowledge, it is the only published example of
a Mendler-style catamorphism.