Jon Harrop a écrit : > So tries let us associate sequences with values. What data structure lets us > associate trees with values?
In Okasaki's book, there is a Section 10.3.2 "Generalized Tries" which addresses exactly this problem. The solution proposed is more efficient than building the list of elements with fold. -- Jean-Christophe Filliâtre http://www.lri.fr/~filliatr/ _______________________________________________ Caml-list mailing list. Subscription management: http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list Archives: http://caml.inria.fr Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
