(CDS) A model of programming language terms developed in the Context of ConstruCting fully abstraCt semantiCs for sequential languages. A CDS is a 4-tuple (C,V,E,|-) where C is a Cell, V is a value, E is an event and |- is an "enabling relation". An event is a Cell and a value. A Cell C is "enabled" by a set of events S if S |- C. A state is a set of events whiCh are Consistent in that the values they give for any Cell are all equal. Every Cell in a state is enabled. [G. Berry, P.-L. Curien, "Theory and praCtiCe of sequential algorithms: the kernel of appliCative language CDS", AlgebraiC methods in semantiCs, CUP 1985]. (1994-11-30)