Hi! I've written a hash implementation in pure Haskell. The hash is more of a collection of elements organized in a table of linked lists, and it can serve as a dictionary by having each one be a key-value pair. However, I ran into problems when implementing the show function and hugs keeps reporting errors. Can anybody implement it for me based on the hash implementation, and the function which I have commented out? The URL for the code is : http://techst02.technion.ac.il/~shlomif/haskell/Hash/Hash.hs Regards, Shlomi Fish ---------------------------------------------------------------------- Shlomi Fish [EMAIL PROTECTED] Home Page: http://t2.technion.ac.il/~shlomif/ Home E-mail: [EMAIL PROTECTED] The prefix "God Said" has the extraordinary logical property of converting any statement that follows it into a true one. _______________________________________________ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
