Jean-Christophe Filliatre <Jean-Christophe.Filliatre@lri.fr> wrote:
>   2. Several  algorithms  over graphs,  written  as  functors and  thus
>      independently of the graph  implementation 

Sounds very useful.  One item I would very much like to see: when one is merely interested in using some (efficient!) 
graph algorithm, there is often a choice of data structures to be made.  Figuring out the asymptotics of each 
algorithm over each data structure is feasible, but should be quite unnecessary: it would be quite convenient if there 
were information functions [as part of the functor modules] which would output the asymptotic behaviour of the 
instantiations.

This would be especially useful as some data structure-algorithm pairs are woefully inefficient, especially when it 
comes to graphs!  

Jacques

-------------------
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