[Haskell-cafe] Re: String vs ByteString

Brandon S Allbery KF8NH allbery at ece.cmu.edu
Sun Aug 15 12:33:34 EDT 2010


-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

On 8/15/10 11:25 , Bill Atkins wrote:
> No, not really.  Linked lists are very easy to deal with recursively and
> Strings automatically work with any already-defined list functions.
> 
> On Sun, Aug 15, 2010 at 11:17 AM, Brandon S Allbery KF8NH
> <allbery at ece.cmu.edu <mailto:allbery at ece.cmu.edu>> wrote:
> 
>     More to the point, there's nothing elegant about [Char] --- its sole
>     "advantage" is requiring no thought.

Except that it seems to me that a number of functions in Data.List are
really functions on Strings and not especially useful on generic lists.
There is overlap but it's not as large as might be thought.

- -- 
brandon s. allbery     [linux,solaris,freebsd,perl]      allbery at kf8nh.com
system administrator  [openafs,heimdal,too many hats]  allbery at ece.cmu.edu
electrical and computer engineering, carnegie mellon university      KF8NH
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v2.0.10 (Darwin)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/

iEYEARECAAYFAkxoFt4ACgkQIn7hlCsL25V+OACfXngN6ZX5L7AL153AkRYDFnqZ
jqsAnA3Lem5LioDVS5bc0ADGzHwWsKFE
=ehkx
-----END PGP SIGNATURE-----


More information about the Haskell-Cafe mailing list