A dictionary implementation in Hasekll

Shlomi Fish shlomif@vipe.technion.ac.il
Sun, 7 Jan 2001 20:00:51 +0200 (IST)

Does anybody knows of an implementation for an efficient dictionary (such 
as a hash, an AVL tree, a B-Tree etc. ) in Haskell? Can an array do that?
I'd like something that can map any type to any other type based on a
comparison function, and perhaps a hashing function.


	Shlomi Fish

Shlomi Fish        shlomif@vipe.technion.ac.il 
Home Page:         http://t2.technion.ac.il/~shlomif/
Home E-mail:       shlomif@techie.com

The prefix "God Said" has the extraordinary logical property of 
converting any statement that follows it into a true one.