<P> Dynamic lists are also more common and easier to implement than dynamic arrays . Array types are distinguished from record types mainly because they allow the element indices to be computed at run time, as in the Pascal assignment A (I, J): = A (N-I, 2 * J). Among other things, this feature allows a single iterative statement to process arbitrarily many elements of an array variable . </P> <P> In more theoretical contexts, especially in type theory and in the description of abstract algorithms, the terms "array" and "array type" sometimes refer to an abstract data type (ADT) also called abstract array or may refer to an associative array, a mathematical model with the basic operations and behavior of a typical array type in most languages--basically, a collection of elements that are selected by indices computed at run - time . </P> <P> Depending on the language, array types may overlap (or be identified with) other data types that describe aggregates of values, such as lists and strings . Array types are often implemented by array data structures, but sometimes by other means, such as hash tables, linked lists, or search trees . </P> <P> Heinz Rutishauser's programming language Superplan (1949--1951) included multi-dimensional arrays . Rutishauser however although describing how a compiler for his language should be built, did not implement one . </P>

An array and the variable that references it hold the same value