There are many presentations of a function in terms of its ‘primitive’ components. These may involve the selection, permutation and duplication of partial results. We show that all argument selection and rearrangement may precede the calculation of the ‘pure’ function, where in no argument rearrangement occurs.
Benson, David B., "All Argument Selection May Be Done First ; CU-CS-108-77" (1977). Computer Science Technical Reports. 106.