English version
Accueil     À propos     Téléchargement     Ressources     Contactez-nous    

Ce site est rarement mis à jour. Pour les informations les plus récentes, rendez-vous sur le nouveau site OCaml à l'adresse ocaml.org.

Browse thread
practical functional programming
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2000-11-08 (17:26)
From: Thorsten Ohl <ohl@h...>
Subject: Re: practical functional programming
Chris Hecker <checker@d6.com> writes:

> I guess my next question then would be related to efficiency: isn't
> there a lot of copying going on if you've got to make a new
> instance of your symbol table just to add an element?

Surprisingly little (if implemented properly, of course).  Ogasaki's
book was really a revelation for me ...

Once one has adopted the proper mindset, persistence can lead to very
concise and efficient programs.  I was amazed how well it works in a
non-trivial combinatorical applications (e.g.:
Thorsten Ohl, Physics Department, TU Darmstadt -- ohl@hep.tu-darmstadt.de
http://heplix.ikp.physik.tu-darmstadt.de/~ohl/ [<=== PGP public key here]