Its mathematical description is more complex. All Scheme arguments are evaluated, and a pointer to the evaluated argument is passed to the called function. However, one can write some functions that give the same effect as C array operations. More complex structures for an array, such as a binary tree instead of a linear list, could speed up access and modification operations.
Recursion is used to allow repetitive execution of code.
Scheme is Turing Complete A Turing Complete language is one that can express a program to compute any computable function. Then the vector V need list only the names of variables which are assigned to in the function being defined. This version can be derived by grouping several C statements together, wherever a sequence of assignment statements occur which all depend on the common values of inputs to the group of statements.