Fundamentals of Computer Science I (CSC-151.02 2000F)


Class 35: Variable-arity procedures

Back to Tail recursion. On to Currying and uncurrying.

Held Tuesday, October 31, 2000

Summary

Today we visit variable-arity procedures, procedures that can take differing numbers of arguments.

Notes

Overview



History

Thursday, 24 August 2000

Back to Tail recursion. On to Currying and uncurrying.


Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2000F/Outlines/outline.35.html

Source text last modified Wed Sep 13 10:49:51 2000.

This page generated on Tue Oct 31 10:56:04 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu