caml-list - the Caml user's mailing list
 help / color / mirror / Atom feed
From: Diego Olivier Fernandez Pons <Diego-Olivier.FERNANDEZ-PONS@cicrp.jussieu.fr>
To: erayo@cs.bilkent.edu.tr
Cc: Caml List <caml-list@inria.fr>
Subject: Re: [Caml-list] Two types of efficiency (Was Efficiency of 'a list)
Date: Tue, 6 May 2003 15:28:46 +0200 (DST)	[thread overview]
Message-ID: <Pine.A41.4.44.0305061449120.3489812-100000@ibm1.cicrp.jussieu.fr> (raw)
In-Reply-To: <200305052105.43350.exa@kablonet.com.tr>

    Bonjour,

On Mon, 5 May 2003, Eray Ozkural wrote:

> But it's almost certain that I will not write any functional
> structure library, ahem :P That's more like optimizing for an
> ensemble of data structures instead of 1 and I think it requires an
> expertise of its own.  Moreover, I don't want to be labeled "failed"
> :)

I did not meant to be rude and Chris Okasaki has made a very good job
promoting purely functional data structures and some important
theoretical work too.

In 1997 Roberto Tamassia and Luca Vismara wrote an article comparing
the design of GeomLib (the geometric package of JDSL) with the STL,
LEDA and CGAL, considering the following points :
- ease of use
- efficiency
- flexibility
- reliability
- extensibility
- reusability
- modularity
- functionality
- correctness checking

The only problem is that 6 years after that seminal paper, Geomlib is
still unreleased.

Okasaki made the same kind of mistake, writting the paper before the
library was ended ('Edison is still mostly a framework. That is, I
provide signatures, but not yet very many implementations. I indend to
populate this framework over the time, adding a new module every few
weeks').

> What I have in mind is tight imperative code like:
> AVL Trees
> B+ Trees
> Disjoint Sets
> Some dynamic hash code
> PQ: Binary Heaps, etc. (I already did binary heap)
> k-d trees (I'm not sure if I wanna go into comp. geometry though ;) )

Structure monster should notice that :

(a) there are already many data structures (purely functional or
imperative) available in Caml. Structure monster should check the Caml
Hump (data structures section) or some pages I wrote on the subject
(http://www.edite-de-paris.com.fr/~fernandz/Caml/index_en.html).

(b) there are already several projects of 'standard libraries',
including the official standard library for Caml. Structure monster
should not begin one more of this projects but join (or use the same
interface, design, naming conventions, ...) one of these.


        Diego Olivier

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


  reply	other threads:[~2003-05-06 13:29 UTC|newest]

Thread overview: 42+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2003-05-02 19:27 [Caml-list] Efficiency of 'a list Eray Ozkural
2003-05-03  5:43 ` Mattias Waldau
2003-05-03  8:16   ` Ville-Pertti Keinonen
2003-05-03 14:12   ` Vitaly Lugovsky
2003-05-03 18:43     ` Mattias Waldau
2003-05-03 20:01       ` Eray Ozkural
2003-05-03 23:17       ` Eray Ozkural
2003-05-04  2:08       ` cashin
2003-05-04  4:08         ` alc
2003-05-04  5:32           ` Ed L Cashin
2003-05-04  6:46           ` [Caml-list] Two types of efficiency (Was Efficiency of 'a list) Mattias Waldau
2003-05-04  7:35             ` John Max Skaller
2003-05-04 11:52               ` Olivier Andrieu
2003-05-05 11:04                 ` John Max Skaller
2003-05-04 16:48               ` brogoff
2003-05-04  7:43             ` Ville-Pertti Keinonen
2003-05-04 12:50               ` Eray Ozkural
2003-05-04 12:48             ` Eray Ozkural
2003-05-05  7:31             ` Diego Olivier Fernandez Pons
2003-05-05 11:11               ` Mattias Waldau
2003-05-05 13:17                 ` John Max Skaller
2003-05-05 11:49               ` Eray Ozkural
2003-05-05 11:57               ` Yaron M. Minsky
2003-05-05 13:32                 ` John Max Skaller
2003-05-06  2:49                   ` Nicolas Cannasse
2003-05-06 12:30                     ` Diego Olivier Fernandez Pons
2003-05-07  2:05                       ` Nicolas Cannasse
2003-05-05 16:38                 ` Diego Olivier Fernandez Pons
2003-05-05 18:05                   ` Eray Ozkural
2003-05-06 13:28                     ` Diego Olivier Fernandez Pons [this message]
2003-05-13 11:35                   ` [Caml-list] Data Structure Libraries (was: Two types of efficiency) Oleg Trott
2003-05-04  7:55           ` [Caml-list] Efficiency of 'a list Ville-Pertti Keinonen
2003-05-04 10:56             ` Neel Krishnaswami
2003-05-04 12:56               ` Eray Ozkural
2003-05-04 13:35                 ` Falk Hueffner
2003-05-04 12:38           ` Eray Ozkural
2003-05-04  8:07         ` Ville-Pertti Keinonen
2003-05-04 15:54           ` Ed L Cashin
2003-05-05 23:52           ` Garry Hodgson
2003-05-03 20:03   ` Eray Ozkural
2003-05-03 21:13 ` Lauri Alanko
2003-05-03 22:03   ` Eray Ozkural

Reply instructions:

You may reply publicly to this message via plain-text email
using any one of the following methods:

* Save the following mbox file, import it into your mail client,
  and reply-to-all from there: mbox

  Avoid top-posting and favor interleaved quoting:
  https://en.wikipedia.org/wiki/Posting_style#Interleaved_style

* Reply using the --to, --cc, and --in-reply-to
  switches of git-send-email(1):

  git send-email \
    --in-reply-to=Pine.A41.4.44.0305061449120.3489812-100000@ibm1.cicrp.jussieu.fr \
    --to=diego-olivier.fernandez-pons@cicrp.jussieu.fr \
    --cc=caml-list@inria.fr \
    --cc=erayo@cs.bilkent.edu.tr \
    /path/to/YOUR_REPLY

  https://kernel.org/pub/software/scm/git/docs/git-send-email.html

* If your mail client supports setting the In-Reply-To header
  via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).