02:46
A random idea that some crazy enough person could pick up: with a bit of knowledge of the Haskell type inference system and a list of equivalences (many of which can be taken from the Haskell golfing tips question) it should be possible in theory to implement an autogolfer which takes Haskell code as input, tries some transformations on it and returns a golfed output (if one is found)
An example of transformation is f x g x which can be transformed into f<$>g$x
f, g, and x here can be arbitrarily complex expressions, and depending on their structure one form or the other may be shorter
As I said, this would be a quite complex project requiring someone crazy enough to try it, but we're on a site full of people who enjoy writing unreadable, inefficient codes for useless problems for fun, so craziness is not missing :D
