Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Computing | Tail recursion optimisation (TRO) When the last thing a function or procedure does is to call itself, it is not necessary to retain the calling environment. This is important when a procedure calls itself recursively many times for, without tail recursion optimisation, the environments of earlier invocations would fill up the memory only to be discarded when (if) the last call terminated. Tail recursion optimisation is a special case of last call optimisation but it allows the further optimisation that some arguments may be passed in situ, possibly in registers. It allows recursive functions to be compiled into iterative loops. See also conversion to iteration, tail recursion modulo cons. Source: The Free On-line Dictionary of Computing. |
Source: compiled by the editor from various references; see credits. | |
Crosswords: TAIL RECURSION OPTIMISATION |
| Specialty definitions using "TAIL RECURSION OPTIMISATION": conversion to iteration ♦ last call optimisation ♦ tail recursion, TRO. (references) |
Source: compiled by the editor from various references; see credits. |
Hexadecimal (or equivalents, 770AD-1900s) (references)54 41 49 4C 52 45 43 55 52 53 49 4F 4E 4F 50 54 49 4D 49 53 41 54 49 4F 4E |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01010100 01000001 01001001 01001100 00100000 01010010 01000101 01000011 01010101 01010010 01010011 01001001 01001111 01001110 00100000 01001111 01010000 01010100 01001001 01001101 01001001 01010011 01000001 01010100 01001001 01001111 01001110 |
HTML Code (1990) (references)T A I L   R E C U R S I O N   O P T I M I S A T I O N |
ISO 10646 (1991-1993) (references)0054 0041 0049 004C 0052 0045 0043 0055 0052 0053 0049 004F 004E 004F 0050 0054 0049 004D 0049 0053 0041 0054 0049 004F 004E |
Encryption (beginner's substitution cypher): (references)5435434625239375552534349482495054434743533554434948 |
| 1. Crosswords 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
