Word:

tail recursion optimisation

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.
Browse
tail coat
Tail coverts
tail end
tail feather
tail fin
tail gate
tail gunner
Tail joist
tail lamp
Tail of a comet
Tail of a gale
Tail of a lock
Tail of the trenches
Tail on
tail recursion
tail recursion modulo cons
-- tail recursion optimisation --
tail rotor
Tail spindle
Tail stock
Tail-bay
tail-flower
tail-strict
Tail-water
Tailage
tailback
Tailblock
Tailboard
tailcoat
Tailed
tailed frog
tailed toad
tailfin
Definitions Index: # A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

About this site and copyright information - Online Dictionary Home - Privacy Policy