title: Lazy List of Prime Numbers
body: <p>How would one implement a list of prime numbers in Haskell so that they could be retrieved lazily?</p>
  
  <p>I am new to Haskell, and would like to learn about practical uses of the lazy evaluation functionality.</p>