meaning of tail recursion optimisation
1. 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. tail-strict A tail-strict function evaluates every cons cell in its list argument. It will therefore fail to terminate if its argument is an infinite list or if any tail of its argument fails to terminate. The archetypal tail-strict function is length. See also Head-strict, Hyper-strict. TAL Transaction Application Language TALE Typed Applicative Language Experiment. M. van Leeuwen. Lazy, purely applicative, polymorphic. Based on typed second order lambda-calculus. "Functional Programming and the Language TALE", H. P. Barendregt et al, in Current Trends in Concurrency, LNCS 224, Springer 1986, pp. 122-207. Taligent A company founded jointly by Apple and IBM in March 1992. HP announced in January, 1994 that it would buy a 15% stake in Taligent. They are working on an "object-oriented operating system", due to be finished sometime in 1995. However, various independent pieces of Taligent will likely appear to be used with other operating systems, e. g. IBMs WorkplaceOS. Pink is an older name for Taligent, dating back to work that Apple did before the formation of Taligent. talk
Related Words
