Haskell --- average of a list.

Rules:

✡ must compute arithmetic average of a list
✡ only one pass is allowed
✡ constant memory

>>39
The average of an arbitrary infinite list cannot be computed in general. How can you know what terms arbitrarily far out in the sequence will do in a finite amount of computations without ``knowing'' the sequence symbolically?