Hans Aberg <[EMAIL PROTECTED]> writes:
> This is in fact one of the more easy questions: One defines a list l on a
> set A to be a map l: [0, x) -> A on a semi-open interval [0, x), where x is
> an ordinal, and 0 is the first (smallest) ordinal. Then the set of all
> lists have type list ([A] in Haskell), just as before: one simply extends
> the possibility of infinities of lists.
For these new lists to be computationally useful, you need new
operations (more than the "check for empty list", "take the head", and
"take the tail" provided by Haskell). What new operations would you
suggest providing? How would they be implemented? (Would they
involve increasing the size of an evaluated list object, to add more
pointers?)
Carl Witty
[EMAIL PROTECTED]
