Prime Number Sieve: A Study in Elementary Haskell Optimization

Recently I ran across the following implementation of the Sieve of Eratosthenes (which calculates all the prime numbers) in post on the Code & Co. blog: