Interesting reduction not caught by hlint.

So I have this function:

-- "Dual" of map, takes an object and a list of functions
-- and applies the object to each function in the list.
pam :: a -> [a -> b] -> [b]
pam a (f:fs) = f a : pam a fs
pam a [] = []

I was able to reduce it to:

pam :: a -> [a -> b] -> [b]
pam a = map (\f -> f a)

Sadly hlint didn't catch this reduction(Although it's able to catch a whole bunch of other reductions in my code any other day!), maybe this might lighten the way for a whole set of new reductions? Thanks for the awesome tool!

Start by running HLint on the issue's pam definition and checking existing reduction suggestions for similar higher-order patterns. Trace the implementation and tests for those suggestions; done means HLint reports the equivalent map (\f -> f a) reduction for this example.