This outline is also available in PDF.
Held: Monday, 1 October 2007
Summary: Today we consider a particular kind of recursion, tail recursion. A tail recursive procedure is one that returns recursive results directly, without further processing. We study tail recursion primarily because a common technique for making a procedure tail recursive is also helpful in other circumstances.
I usually create these pages
on the fly, which means that I rarely
proofread them and they may contain bad grammar and incorrect details.
It also means that I tend to update them regularly (see the history for
more details). Feel free to contact me with any suggestions for changes.
This document was generated by
Siteweaver on Mon Dec 3 09:55:59 2007.
The source to the document was last modified on Sun Sep 16 06:00:26 2007.
This document may be found at
You may wish to validate this document's HTML ; ;Samuel A. Rebelsky, firstname.lastname@example.org
http://creativecommons.org/licenses/by-nc/2.5/or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.