I thought so too at first but given the way addition is defined later on, it makes sense to keep the coefficients sorted by increasing power (the leftmost element in the list is its head, and the easiest to access when doing anything recursive)
eval =
v [] => 0
v x:xs => x + v * eval v xs
You do have to love how clean definition by cases makes these sorts of things.You either need to use foldr to defer the multiply-and-add until the end of the list is processed, or reverse the list before processing it.