 a list and returns a new list of transformed items.</li>
<li>The recursive strategy is to apply the operation to the <code>car</code> of the list, and then <code>cons</code> that onto the rest of the list which has already been mapped (wishful thinking).</li>
<li>Rather than doing this manually each time, we use the higher-order procedure <code>map</code>.</li>
<li>Thinking in terms of operations on aggregates is a powerful idea. It liberates us from worrying about recursion or other details.</li>
<li><cod