CONCRETE DATA STRUCTURE
\kˈɒŋkɹiːt dˈe͡ɪtə stɹˈʌkt͡ʃə], \kˈɒŋkɹiːt dˈeɪtə stɹˈʌktʃə], \k_ˈɒ_ŋ_k_ɹ_iː_t d_ˈeɪ_t_ə s_t_ɹ_ˈʌ_k_tʃ_ə]\
Sort: Oldest first
-
(CDS) A model of programming language terms developed inthe context of constructing fully abstract semantics forsequential languages. A CDS is a 4-tuple (C,V,E,|-) where C isa cell, V is a value, E is an event and |- is an "enablingrelation". 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 whichare consistent in that the values they give for any cell are allequal. Every cell in a state is enabled.[G. Berry, P.-L. Curien, "Theory and practice of sequentialalgorithms: the kernel of applicative language CDS", Algebraicmethods in semantics, CUP 1985].
By Denis Howe