[Haskell-cafe] Circular pure data structures?

[Ross Mellgren]

Yes, using lazy semantics.

http://www.haskell.org/haskellwiki/Tying_the_Knot

-Ross

On Jul 14, 2009, at 6:27 PM, John Ky wrote:

> Hello,
>
> Is it possible to create a circular pure data structure in Haskell?   
> For example:
>
> a :: Data
>
> let b = getNext a
> let c = getNext b
>
> c == a -- Gives True
>
> Thanks,
>
> -John
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe