Version française
Home     About     Download     Resources     Contact us    
Browse thread
[Caml-list] Recursive lists
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Alex Baretta <alex@b...>
Subject: Re: [Caml-list] Recursive lists
Sébastien Furic wrote:
> 
>  You can use lazy lists to solve the problem. A lazy list delivers its 
> elements on demand so you can manipulate infinite lists safely provided 
> you don't print their whole contents for instance...
>  See http://caml.inria.fr/archives/200304/msg00280.html to see how to 
> implement them (they're not present in the OCaml distribution).
> 
>  Sébastien.

Lazy lists or streams are not good enough in the general scenario. We 
don't need to exhaustively explore the cyclic data structures. The 
properties we are interested in can be proven in finite time by 
analyzing the list structure with the physical equality operator.

Alex

-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners