[Haskell-cafe] List spine traversal

Ryan Ingram ryani.spam at gmail.com
Tue Jun 30 02:30:54 EDT 2009

On Mon, Jun 29, 2009 at 7:36 PM, Geoffrey
Marchant<geoffrey.marchant at gmail.com> 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
> xs2 = f () where f () = () : f ()

  -- ryan

More information about the Haskell-Cafe mailing list