[Haskell-cafe] overloaded list literals?

Serguey Zefirov sergueyz at gmail.com
Mon Sep 6 15:31:48 EDT 2010

2010/9/6 Bulat Ziganshin <bulat.ziganshin at gmail.com>:
> Hello Serguey,
> Monday, September 6, 2010, 8:16:03 PM, you wrote:
>> 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.
> what i propose should allow to convert algorithm dealing with strings
> into algorithm dealing with ByteStrings, simply by changing import
> statement

View patterns?..

Also, I think that some general optimization that can fold
computations together (like supercompilation) will certainly help

> it's a cute goal - keep Haskell strings easy of use but add ByteString
> performance

Completely agree, this is a noble goal.

But ByteStrings aren't polymorphic. So they cannot satisfy your class.

More information about the Haskell-Cafe mailing list