Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Computing | Computational Adequacy Theorem This states that for any program (a non-function typed term in the typed lambda-calculus with constants) normal order reduction (outermost first) fails to terminate if and only if the standard semantics of the term is bottom. Moreover, if the reduction of program e1 terminates with some head normal form e2 then the standard semantics of e1 and e2 will be equal. This theorem is significant because it relates the operational notion of a reduction sequence and the denotational semantics of the input and output of a reduction sequence. Source: The Free On-line Dictionary of Computing. |
Source: compiled by the editor from various references; see credits. | |
Crosswords: COMPUTATIONAL ADEQUACY THEOREM |
| Specialty definitions using "COMPUTATIONAL ADEQUACY THEOREM": normal order reduction. (references) |
Hexadecimal (or equivalents, 770AD-1900s) (references)43 4F 4D 50 55 54 41 54 49 4F 4E 41 4C 41 44 45 51 55 41 43 59 54 48 45 4F 52 45 4D |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000011 01001111 01001101 01010000 01010101 01010100 01000001 01010100 01001001 01001111 01001110 01000001 01001100 00100000 01000001 01000100 01000101 01010001 01010101 01000001 01000011 01011001 00100000 01010100 01001000 01000101 01001111 01010010 01000101 01001101 |
HTML Code (1990) (references)C O M P U T A T I O N A L   A D E Q U A C Y   T H E O R E M |
ISO 10646 (1991-1993) (references)0043 004F 004D 0050 0055 0054 0041 0054 0049 004F 004E 0041 004C 0041 0044 0045 0051 0055 0041 0043 0059 0054 0048 0045 004F 0052 0045 004D |
Encryption (beginner's substitution cypher): (references)3749475055543554434948354623538395155353759254423949523947 |
| 1. Crosswords 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
