Home Articles FAQs XREF Games Software Instant Books BBS About FOLDOC RFCs Feedback Sitemap

last call optimisation

You are here: irt.org | FOLDOC | last call optimisation

<programming> (Or "tail call optimisation") Discarding the immediate calling context (call stack frame) when the last action of a function or procedure, A, is to call another function or procedure, B. B will then return directly to A's caller, or possibly further up the call stack if the optimisation has been applied to several consecutive calls.

Last call optimisation allows arbitrarily deep nesting of procedure calls without consuming memory to store useless environments. This is particularly useful in the special case of tail recursion optimisation, where a procedure's last action is to call itself (possibly indirectly).


Nearby terms: laser « laser printer « Lasherism « last call optimisation » last-in first-out » LAT » latch

FOLDOC, Topics, 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, ?, ALL

©2018 Martin Webb