We show that the notion of sequentiality as presented in concrete data structures may be carried to a more general domain-theoretic framework. Cells are replaced by some linear maps on a domain which turns out to be a DI-domain. In a first phase we do not require the cells to be enabled as they are in CDSs, and we get a weak form of cartesian-closedness. Then, by enriching the structure, we get the standard one.
