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