Another question about higher order functions

[Friedrich Dominicus]

As you might know, I'm working to find my way through Haskell using
School of Expression from Paul Hudak.  I have done all the examples up
to chapter 5. I do think I've learned quite a bit. But again I'm
wondering if this:

makeChange :: Int -> [Int] -> [Int]
makeChange 0 (c:coins) = 0:makeChange 0 coins
makeChange 0 [] = []
makeChange n (coin_val:coins) = let (how_many,rest) = divMod n coin_val
       in
       how_many:makeChange rest coins


could be replaces by some combination of HOFs. Could someone give me a
hand here?

Thanks in advance 
Friedrich