title: infinite Datastructures in D
body: <p>I found examples of lazy evaluation of function arguments in D <a href="http://www.digitalmars.com/d/2.0/lazy-evaluation.html">http://www.digitalmars.com/d/2.0/lazy-evaluation.html</a></p>
  
  <p>I´m wondering how to implement possible infinite Datastructures in D like it´s common behaviour of haskell´s lists.</p>
  
  <p>Are there some Examples ? </p>
  
  <p>What is the equivalent of the infinite fibonacci sequence:</p>
  
  <pre><code>fibs = 0 : 1 : zipWith (+) fibs (tail fibs)
  </code></pre>