[Haskell-cafe] Confused about Cyclic struture

[Dinh Tien Tuan Anh]

  Another question, it's said in the book that using cyclic structure (like 
ones = 1:ones) , the list would be represented by a fixed amount of memory.

  Does it mean [1,1,1......] only occupy one cell of memory ?
  How about  in " take 100 [1,1,...] " ?



>From: "Dinh Tien Tuan Anh" <tuananhbirm at hotmail.com>
>To: haskell-cafe at haskell.org
>Subject: Re: [Haskell-cafe] Confused about Cyclic struture
>Date: Fri, 08 Jul 2005 11:41:02 +0000
>
>
>  So is sharing already implemented in Haskell ?
>
>Do i have to use "where" clause to implement the sharing ?
>
>Thanks a lot for your help
>Cheers
>
>>
>>To understand cyclic structures it is useful to think of "graph
>>reduction", because these graphs allow us to conveniently represent
>>sharing between objects. Cycles are simply "self-sharing".
>>
>
>_________________________________________________________________
>It's fast, it's easy and it's free. Get MSN Messenger 7.0 today! 
>http://messenger.msn.co.uk
>
>_______________________________________________
>Haskell-Cafe mailing list
>Haskell-Cafe at haskell.org
>http://www.haskell.org/mailman/listinfo/haskell-cafe

_________________________________________________________________
Be the first to hear what's new at MSN - sign up to our free newsletters! 
http://www.msn.co.uk/newsletters