Fwd: [Haskell-cafe] Bytestrings and [Char]

2010-03-24 Thread Alberto G. Corona
-- Forwarded message -- From: Alberto G. Corona agocor...@gmail.com Date: 2010/3/24 Subject: Re: [Haskell-cafe] Bytestrings and [Char] To: Stephen Tetley stephen.tet...@gmail.com 2010/3/24 Stephen Tetley stephen.tet...@gmail.com Hi Alberto I rather doubt a valuable set of

Fwd: [Haskell-cafe] Bytestrings and [Char]

2010-03-24 Thread Alberto G. Corona
2010/3/24 Stephen Tetley stephen.tet...@gmail.com If you consider containers as the containers package, the data structures are all (?) functorial - but they have different shapes, so e.g. a cons operation makes sense on the linear ones (Data.Sequence, Data.List) but not on Data.Map,

Fwd: [Haskell-cafe] Bytestrings and [Char]

2010-03-23 Thread Alberto G. Corona
The question can be generalized via type classes: Is there any common set of primitives encapsulated into a single type class that has instances for Strings (Data.List) ByteStrings, Data.Text, Lazy bytestrings, Arrays, vectors and wathever container that can store an boxed, unboxed, packed

Fwd: [Haskell-cafe] Bytestrings and [Char]

2010-03-23 Thread Alberto G. Corona
Just a dream: -separate interface and implementation for all containers, via type classes -develop, by genetic programming techniques + quickcheck, a system that find the best container implementation for a particular program. Is that suitable for a Google Summer of Code project? 2010/3/23