In previous work, we invented the notion of functional strategies, that is, first-class generic functions which can traverse into terms of any type while mixing uniform and type-specific behaviour. In the present paper, we reconstruct functional strategies in Haskell in an extremely compact style relying on just two combinators: adhoc for type-based function dispatch, and hfoldr for folding over constructor applications. This reconstruction constitutes yet another way to turn Haskell into a (more) generic programming language. Our approach is lightweight (both for language users and implementors) , highly expressive, well-founded, and has already proven its value in important application domains.