A typical (11) language contains an applicative sub-language which approximates the mathematical abstractions of "timeless" functions applied to "spaceless’ values, where the actual operation sequences and use of storage space during expression evaluation are organized behind the (12) . In this setting, values are data structures of low volume, typically a few computer words or less, which means that an illusion of spacelessness can be realized by having (13) results during expression evaluation stored at the discretion of the language implementation, and effecting parameter (14) and (15) operations through value copying.
A．middle
B．intermediate
C．previous
D．final