comparative study of iteration and ordered collections

[Darius Bacon]

> I'm trying to figure out what kind of data structure I should use for
> ordinary ordered collections in Bicicleta: some kind of numerically-
> indexed vector, or a Lisp-style externally-singly-linked list?

How about immutable cords/ropes as in E? They support both reasonably
efficient indexing and structure sharing like cons pairs. I've had it
in mind for quite a while to follow this approach in my next 'real'
language, although so far none has been real enough to bother.

Darius