References

A basic understanding of function calls and C or C++ calling conventions may be gleaned from the C and C++ texts listed in references for Chapters 2 and 3.

The flow-of-control aspects of function calls and use of the system stack are described in the operating system texts listed in Chapter 2.

Theoretical aspects of recursion:

Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C., Introduction to Algorithms , McGraw-Hill, New York, 2002 .

Felleisen, M., Findler, R. B., Flatt, M., and Krishnamurthi, S., How to Design Programs - An Introduction to Computing and Programming , MIT Press, Cambridge, MA, 2001 .

Mendelson, E., Introduction to Mathematical Logic , 4th ed., Chapman & Hall / CRC Press, Boca Raton, FL, 1997 .

Odifreddi, P., Classical Recursion Theory , North-Holland, Amsterdam, 1999 .

Programmatic aspects of recursion:

Smith, O. J. A., "Stack Free Recursion", http://www.olympus.net/personal/7seas/recurse.html .

Syck, G., "Removing Recursion from Algorithms", C/C++ Users Journal, February 1991 .