I think I can see the point of forcing a list without forcing the actual data, but is there a way to do this that works on circular lists as well?<div><br><br><div class="gmail_quote">On Mon, Jun 29, 2009 at 3:30 AM, Ketil Malde <span dir="ltr">&lt;<a href="mailto:ketil@malde.org">ketil@malde.org</a>&gt;</span> wrote:<br>

<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;"><div class="im">Deniz Dogan &lt;<a href="mailto:deniz.a.m.dogan@gmail.com">deniz.a.m.dogan@gmail.com</a>&gt; writes:<br>


<br>
&gt; What is the spine of a list? Google seems to fail me on this one.<br>
<br>
</div>A (single-linked) list can be seen as a set of cons cells, where each<br>
cell contains two pointers, one to the next cons cell, and one to the<br>
cell&#39;s data contents (&#39;car&#39; and &#39;cdr&#39; in Lisp parlance).<br>
<br>
The spine of the list is the cons cells and the next pointers, that<br>
is, the structure of the list, but not the actual data contained in<br>
it.<br>
<br>
-k<br>
<font color="#888888">--<br>
If I haven&#39;t seen further, it is by standing in the footprints of giants<br>
</font><div><div></div><div class="h5">_______________________________________________<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>
</div></div></blockquote></div><br></div>