OnlineWoerterBuecher.de
Internes

Lexikon


last call optimisation


Normally when procedure A calls procedures B, C, .., Z, the environment of procedure A is only discarded when procedure Z returns and procedure A itself terminates. Using last call optimisation, A' s environment is discarded as Z is called. This allows arbitrarily deep nesting of procedure calls without consuming memory to store useless environments. A special case of this is tail recursion optimisation where the last procedure called is the calling procedure itself.

In addition suitable contents:
[ ai ] [ al ] [ an ] [ ar ] [ as ] [ at ] [ B ] [ b ] [ bi ] [ bit ] [ C ] [ ca ] [ card ] [ case ] [ ci ] [ co ] [ con ] [ cons ] [ cu ] [ de ] [ disc ] [ du ] [ ec ] [ ed ] [ edu ] [ ee ] [ environment ] [ er ] [ es ] [ et ] [ h ] [ il ] [ in ] [ io ] [ ir ] [ iron ] [ is ] [ it ] [ la ] [ li ] [ ls ] [ ly ] [ ma ] [ mall ] [ memory ] [ mo ] [ N ] [ na ] [ ne ] [ ng ] [ nl ] [ ns ] [ op ] [ pe ] [ pr ] [ procedure ] [ pt ] [ re ] [ recursion ] [ ro ] [ sa ] [ sc ] [ se ] [ si ] [ spec ] [ st ] [ store ] [ su ] [ sum ] [ T ] [ tail recursion ] [ tail recursion optimisation ] [ th ] [ to ] [ tr ] [ um ] [ us ] [ vi ] [ ws ] [ Z ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2569 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.088 Seconds, with 16 Database-Queries
Zurück zur Startseite