Haskell Container class

Question

Is there a good standard (or just stable) implementation of (ordered) Container class?

Container class should provide basic manipulation operations with it's instances. Typical instances should be: Array, List, e.t.c.

Operations are:

• take n'th element from container;
• take n first element's of container;
• and so on.

Why do I need this? With the help of this class I can, for example, define some function for processing something in container, and use it with any container that I need.

Answer 1

It sounds like you may find ListLike interesting. index and take, respectively, cover the two operations you mentioned and it includes some 'typical instances'.