Abstract Collections vs. FunDeps

[Dylan Thurston]

On Fri, Apr 02, 2004 at 11:21:05AM +0200, Robert Will wrote:
> On Fri, 26 Mar 2004, Dylan Thurston wrote:
> > Also, they're vitally necessary for certain algorithms and for speed
> > (since not all ways of making containers can contain all items).
> 
> If you mean restricting some Containers to certain element types (Patricia
> trees and so on), this is perfectly possible without FunDeps.  ...

I did mean that, and thanks for explaining how I was being silly!

I am now more convinced than before that the 'Eq' and 'Ord'
constraints on your classes don't belong; if I want to implement the
ridiculously slow list-based implementation of Sets currently in the
Prelude, which only needs equality and nothing else, why can't I?

Peace,
	Dylan
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 189 bytes
Desc: Digital signature
Url : http://www.haskell.org//pipermail/libraries/attachments/20040402/d40ec9e6/attachment.bin