This is an idea that has been kicking around for a long time.&nbsp; But no Haskell implementation that I know of implements it.<br><br><div class="gmail_quote">On Nov 27, 2007 3:43 PM, Maurí­cio &lt;<a href="mailto:briqueabraque@yahoo.com">
briqueabraque@yahoo.com</a>&gt; wrote:<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">Hi,<br><br>If available memory is low, is the<br>garbage collector going to eliminate
<br>data that is still referenced, but<br>it knows it can be recalculated when<br>needed?<br><br>Thanks,<br>Maurício<br><br>_______________________________________________<br>Haskell-Cafe mailing list<br><a href="mailto:Haskell-Cafe@haskell.org">
Haskell-Cafe@haskell.org</a><br><a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br></blockquote></div><br>