Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Computing | Head normalisation theorem Under the typed lambda-calculus, beta/delta reduction of the left-most redex (normal order reduction) is guaranteed to terminate with a head normal form if one exists. See also Church-Rosser theorem. Source: The Free On-line Dictionary of Computing. |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)48 45 41 44 4E 4F 52 4D 41 4C 49 53 41 54 49 4F 4E 54 48 45 4F 52 45 4D |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01001000 01000101 01000001 01000100 00100000 01001110 01001111 01010010 01001101 01000001 01001100 01001001 01010011 01000001 01010100 01001001 01001111 01001110 00100000 01010100 01001000 01000101 01001111 01010010 01000101 01001101 |
HTML Code (1990) (references)H E A D   N O R M A L I S A T I O N   T H E O R E M |
ISO 10646 (1991-1993) (references)0048 0045 0041 0044 004E 004F 0052 004D 0041 004C 0049 0053 0041 0054 0049 004F 004E 0054 0048 0045 004F 0052 0045 004D |
Encryption (beginner's substitution cypher): (references)42393538248495247354643533554434948254423949523947 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
