(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)