[Haskell-cafe] List spine traversal

[Ketil Malde]

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