Use higher-order-functions instead of recursion

Question

i want to write an function f, which converts a binary list to an integer, like:

f :: [Integer] -> Integer
f [] = 0
f list = (last list) * 2^(length list -