Lawrence Bottorff writes:
> Here's what I have in a buffer:
>
> * This basic pseudo-code tells of an internally-defined variable that holds,
> /accumulates/ as the recursion drills down:
>
> \begin{align*}
> sumprod(x) \equiv if \; eq(x,NIL) \; then \; 2.list(s,p) \\
> else \\
> \{let \; z =
Here's what I have in a buffer:
* This basic pseudo-code tells of an internally-defined variable that
holds, /accumulates/ as the recursion drills down:
\begin{align*}
sumprod(x) \equiv if \; eq(x,NIL) \; then \; 2.list(s,p) \\
else \\
\{let \; z = sumprod(cdr(x)) \\
2.list(car(z) + car(x)
