Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Computing | Concrete Data Structure (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). Source: The Free On-line Dictionary of Computing. |
Source: compiled by the editor from various references; see credits. | |
Crosswords: CONCRETE DATA STRUCTURE |
| Specialty definitions using "CONCRETE DATA STRUCTURE": CDS ♦ knowledge representation. (references) |
Hexadecimal (or equivalents, 770AD-1900s) (references)43 4F 4E 43 52 45 54 45 44 41 54 41 53 54 52 55 43 54 55 52 45 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000011 01001111 01001110 01000011 01010010 01000101 01010100 01000101 00100000 01000100 01000001 01010100 01000001 00100000 01010011 01010100 01010010 01010101 01000011 01010100 01010101 01010010 01000101 |
HTML Code (1990) (references)C O N C R E T E   D A T A   S T R U C T U R E |
ISO 10646 (1991-1993) (references)0043 004F 004E 0043 0052 0045 0054 0045 0044 0041 0054 0041 0053 0054 0052 0055 0043 0054 0055 0052 0045 |
Encryption (beginner's substitution cypher): (references)37494837523954392383554352535452553754555239 |
| 1. Crosswords 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
