In computer programming, a function (also procedure, method, subroutine, routine, or subprogram) is a callable unit of software logic that has a well-defined...

stack is a stack data structure that stores information about the active subroutines of a computer program. This type of stack is also known as an execution...

subroutine is a subroutine which cannot in turn call another subroutine. Some compilers can apply special program optimizations to leaf subroutines,...

where the code has a form that essentially consists entirely of calls to subroutines. It is often used in compilers, which may generate code in that form...

special kind of variable used in a subroutine to refer to one of the pieces of data provided as input to the subroutine. These pieces of data are the values...

Reentrancy is a programming concept where a function or subroutine can be interrupted and then resumed before it finishes executing. This means that the...

dictionary. In computer programming, a thunk is a subroutine used to inject a calculation into another subroutine. Thunks are primarily used to delay a calculation...

to implement a computer program. Historically, a library consisted of subroutines (generally called functions today). The concept now includes other forms...

idempotent subroutines where at least one subroutine is different from the others, however, is not necessarily idempotent if a later subroutine in the sequence...

for short) is a register which holds the address to return to when a subroutine call completes. This is more efficient than the more traditional scheme...