[prev in list] [next in list] [prev in thread] [next in thread] 

List:       haskell-cafe
Subject:    Re: [Haskell-cafe] FiniteMap-like module for unordered keys?
From:       Jorge Adriano Aires <jadrian () mat ! uc ! pt>
Date:       2004-11-09 23:41:49
Message-ID: 200411092341.49891.jadrian () mat ! uc ! pt
[Download RAW message or body]

Hello, 

> A hash-table becomes rather useless without mutable state AFAICS.
> Without it, one might almost just as well use a list of pairs...

Could you please elaborate? Is there motive why an Hash Table, implemented as 
FiniteMap of Lists, for instance, wouldn't be worth to using over a simple 
List? (This wouldn't help G. Klyne of course). I've always wondered why a 
non-monadic version of is not provided in the GHC libs... 

J.A.

[prev in list] [next in list] [prev in thread] [next in thread]