[Haskell-cafe] List spine traversal

[Geoffrey Marchant]

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?

On Mon, Jun 29, 2009 at 3:30 AM, Ketil Malde <ketil at malde.org> wrote:

> Deniz Dogan <deniz.a.m.dogan at gmail.com> writes:
>
> > What is the spine of a list? Google seems to fail me on this one.
>
> A (single-linked) list can be seen as a set of cons cells, where each
> cell contains two pointers, one to the next cons cell, and one to the
> cell's data contents ('car' and 'cdr' in Lisp parlance).
>
> The spine of the list is the cons cells and the next pointers, that
> is, the structure of the list, but not the actual data contained in
> it.
>
> -k
> --
> If I haven't seen further, it is by standing in the footprints of giants
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20090629/83bc84df/attachment.html