Computer Science Fundamentals (CS153 2003S)

Class 11: Local Procedures

Back to Preconditions and Postconditions. On to Variable-Arity Procedures.

Held: Wednesday, 5 February 2003

Summary: Today we investigate the two key mechanisms used for defining local recursive procedures in Scheme: letrec and named let.

Related Pages:

Assignments:

Notes:

Overview:

Lab

 

History

Thursday, 15 January 2003 [Samuel A. Rebelsky]

Tuesday, 4 February 2003 [Samuel A. Rebelsky]

 

Back to Preconditions and Postconditions. On to Variable-Arity Procedures.

Disclaimer: 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 Tue May 6 09:20:25 2003.
The source to the document was last modified on Tue Feb 4 21:23:33 2003.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS153/2003S/Outlines/outline.11.html.

You may wish to validate this document's HTML ; Valid CSS! ; Check with Bobby

Samuel A. Rebelsky, rebelsky@grinnell.edu