In this work we present the specification and the implementation
of a new abstract data type (ADT) called STORE. This new ADT allows
the storage of a given collection of elements offering an abstract
mechanism that supplies a direct access to them, alternative to the
method defined by the standard operations of usual ADTs. The interest
of the new mechanism stems from the efficiency of pointers, while
avoiding the loss of modularity that usually occurs when pointers
are used. The implementation of the operations offered by the new
ADT is done by derivation from the equational specification. The
representation chosen for the implementation of the new ADT makes
the efficiency previously mentioned possible, even when the
representation strategy requires the movement of the elements.Postprint (published version
