Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

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: -- (:)
From: Thorsten Ohl <ohl@h...>
Subject: Re: practical functional programming
Chris Hecker <> 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 -- [<=== PGP public key here]