FW: [Caml-list] Data structures and algorithms in Caml programs

Dear Haskell library folk Here's an interesting survey about data structure libraries. It's Caml oriented, but very relevant to Haskell too. Simon -----Original Message----- From: owner-caml-list@pauillac.inria.fr [mailto:owner-caml-list@pauillac.inria.fr] On Behalf Of Diego Olivier Fernandez Pons Sent: 10 December 2003 14:43 To: caml-list@inria.fr Subject: [Caml-list] Data structures and algorithms in Caml programs Bonjour, I have reviewed 20 programs I think representative of Caml, trying to investigate the usages and needs in data structures and algorithms. http://www.edite-de-paris.com.fr/~fpons/Caml/Ressources/dsInCaml.html The purpose is to have a more precise idea of what is really giving trouble and help library designers to provide solutions that are closely related to the programmers needs. All comments are welcome including corrections and programmers feedback on code design, etc. Reviewed programs Caml (21) (data) aifad, ibal (bioinformatics) biocaml (compilation) ccured, dml, fftw, flowcaml, mojave (constraint solving) cime, facile, wallace (parsing) cil, cfg, sister-head (text) cduce, galax, hevea, regex, timbuk (theorem proving) coq, harrison, link Standard ML (1) (compilation) mlrisc Haskell (4) (parsing) alex, happy, parsec (text) regexplib
participants (1)
-
Simon Peyton-Jones