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

In addition suitable contents:
[ ag ] [ ai ] [ al ] [ algorithm ] [ am ] [ an ] [ app ] [ applicative language ] [ ar ] [ at ] [ B ] [ b ] [ br ] [ bs ] [ by ] [ C ] [ ca ] [ cat ] [ CD ] [ CDS ] [ cell ] [ ch ] [ co ] [ con ] [ cons ] [ context ] [ CU ] [ D ] [ de ] [ E ] [ ed ] [ enabling ] [ er ] [ es ] [ et ] [ event ] [ fo ] [ for ] [ G ] [ ge ] [ gi ] [ gr ] [ gu ] [ h ] [ hat ] [ hm ] [ ie ] [ in ] [ io ] [ is ] [ it ] [ ke ] [ kernel ] [ la ] [ language ] [ li ] [ lu ] [ ly ] [ ma ] [ man ] [ method ] [ mm ] [ mo ] [ mod ] [ mode ] [ model ] [ ms ] [ na ] [ ne ] [ ng ] [ ns ] [ op ] [ pe ] [ pl ] [ pr ] [ program ] [ programming ] [ programming language ] [ re ] [ relation ] [ ro ] [ ru ] [ S ] [ se ] [ semantics ] [ set ] [ si ] [ st ] [ state ] [ struct ] [ T ] [ text ] [ th ] [ tr ] [ tuple ] [ ua ] [ up ] [ V ] [ va ] [ value ] [ ve ]