[Haskell-cafe] overloaded list literals?

[Iavor Diatchki]

Hi,
actually this idea generalizes quite nicely.  Details and examples are
available in Section 3 of "Language and Program Design for Functional
Dependencies", available at
http://web.cecs.pdx.edu/~mpj/pubs/fundeps-design.html
-Iavor


On Mon, Sep 6, 2010 at 3:58 PM, Wolfgang Jeltsch
<g9ks157k at acme.softbase.org> wrote:
> Am Montag, den 06.09.2010, 19:38 +0400 schrieb Bulat Ziganshin:
>> btw, i also had proposal to automatically convert typeclasses used in
>> type declarations into constraints, so that:
>>
>> putStr :: StringLike -> IO ()
>>
>> treated as
>>
>> putStr :: StringLike s => s -> IO ()
>
> This blurs the distinction between classes and types, which are two
> fundamentally different concepts in Haskell. In addition, it works only
> for special cases. I would like the language to be simple. Alas, more
> and more sugar is added to Haskell, which makes it unnecessarily
> complicated.
>
> Best wishes,
> Wolfgang
>
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>