[Haskell-cafe] overloaded list literals?

Serguey Zefirov sergueyz at gmail.com
Mon Sep 6 12:16:03 EDT 2010

2010/9/6 Bulat Ziganshin <bulat.ziganshin at gmail.com>:
> Hello Serguey,
> Monday, September 6, 2010, 7:57:46 PM, you wrote:
>>> http://www.mail-archive.com/haskell-cafe@haskell.org/msg15656.html
>> Will Data.Map with its' empty, insert, findMin, etc, "methods" conform
>> to your proposed type?
> but Data.Map isn't sequential container. instead, it maps arbitrary
> keys to values

That situation reminds me situation with Set Monad instance. ;)

Basically, you - and others, - propose to add another class isomorphic
to already present lists. I think, most benefits of that class can be
achieved by using list conversion and RULE pragma.

More information about the Haskell-Cafe mailing list