[PRL] Implementing sets efficiently in a functional language

[David Herman]

For those of us taking Algorithms this semester, this paper might be 
interesting. Apparently there was a shorter version in JFP, but that's 
not available on the web. I've only skimmed it, but it looks like a 
nice example (aside from the atrocious spelling) of algorithms in FP, 
to compare to the imperative versions we've been learning.

     Adams, Stephen. Implementing Sets Efficiently in a Functional 
Language, 1993.
     http://swiss.csail.mit.edu/~adams/BB/

Apparently the algorithms presented in this paper were used for the 
Data.FiniteMap data structure in the GHC Haskell library as well.

Dave