So, is the <- in Haskell list comprehension an arrow (as in, ``take the x from''), or does it imitate the ∈ character from the mathematical set notation?
e.g. {x2 : x ∈ ℕ} and [x | x <- [0,1..]]).
>>2
You could easily deduce which if you were competent with set notation. If it did mean where x is a member of the set, then repeated elements of the array would only be taken once.
>>11 http://foldoc.org/index.cgi?query=array&action=Search A collection of identically typed data items distinguished by their indices (or "subscripts"). The number of dimensions an array can have depends on the language but is usually unlimited.
http://foldoc.org/index.cgi?lists A data structure holding many values, possibly of different types, which is usually accessed sequentially, working from the head to the end of the tail - an "ordered list".
>>18
You failed to miss the most important point, which is that arrays are random-access and lists have to be traversed¹. It is quite possible to have heterogenous arrays, see Scheme's vector² type for an example.