[Haskell-cafe] Restricted type classes

Ivan Lazar Miljenovic ivan.miljenovic at gmail.com
Sat Sep 4 04:57:57 EDT 2010


On 4 September 2010 18:54, Stephen Tetley <stephen.tetley at gmail.com> wrote:
> Supposing classes is the way to go, I think there's still a lot of
> design work to be done on what the classes should be rather than how
> they are implemented. The current design space (ListLike and your
> Data.Containers) looks like a factoring of the operations from
> Data.List and Data.Sequence, personally I have serious doubts that
> this will lead to a nice API. If I was looking at it myself, I'd start
> from Chris Okasaki and Ralf Hinze's observations that data structures
> have analogies to numerical representations. So, I would try to build
> classes upwards from that (monoid is obviously already in place),
> rather than design by factoring what List already has. As an example,
> I think someone has pointed out on the Cafe that C++ has a container
> library following the analogy to numerical representations.

Where exactly can I find these observations on the analogies between
data structures and numerical representations?

-- 
Ivan Lazar Miljenovic
Ivan.Miljenovic at gmail.com
IvanMiljenovic.wordpress.com


More information about the Haskell-Cafe mailing list