Re: [Haskell-cafe] List spine traversal

On Mon, Jun 29, 2009 at 7:36 PM, Geoffrey Marchant wrote:

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?

There can't be a way to do so that is pure, because such a function could distinguish between

xs1 = () : xs1 and xs2 = f () where f () = () : f ()

-- ryan