<P> The specifics of variable allocation and the representation of their values vary widely, both among programming languages and among implementations of a given language . Many language implementations allocate space for local variables, whose extent lasts for a single function call on the call stack, and whose memory is automatically reclaimed when the function returns . More generally, in name binding, the name of a variable is bound to the address of some particular block (contiguous sequence) of bytes in memory, and operations on the variable manipulate that block . Referencing is more common for variables whose values have large or unknown sizes when the code is compiled . Such variables reference the location of the value instead of storing the value itself, which is allocated from a pool of memory called the heap . </P> <P> Bound variables have values . A value, however, is an abstraction, an idea; in implementation, a value is represented by some data object, which is stored somewhere in computer memory . The program, or the runtime environment, must set aside memory for each data object and, since memory is finite, ensure that this memory is yielded for reuse when the object is no longer needed to represent some variable's value . </P> <P> Objects allocated from the heap must be reclaimed--especially when the objects are no longer needed . In a garbage - collected language (such as C#, Java, Python, Golang and Lisp), the runtime environment automatically reclaims objects when extant variables can no longer refer to them . In non-garbage - collected languages, such as C, the program (and the programmer) must explicitly allocate memory, and then later free it, to reclaim its memory . Failure to do so leads to memory leaks, in which the heap is depleted as the program runs, risks eventual failure from exhausting available memory . </P> <P> When a variable refers to a data structure created dynamically, some of its components may be only indirectly accessed through the variable . In such circumstances, garbage collectors (or analogous program features in languages that lack garbage collectors) must deal with a case where only a portion of the memory reachable from the variable needs to be reclaimed . </P>

Which is identified as a special variable which can store multiple values in one single variable