CS151.02 2010S Functional Problem Solving

Class 31: Naming Local Procedures

Back to Preconditions, Revisited. On to Randomized (Unpredictable) Drawing.

This outline is also available in PDF.

Held: Wednesday, March 17, 2010

Summary: We explore why and how one writes local recursive procedures.

Related Pages:



Husk and Kernel Programming

Local Procedure Bindings


Named let

An Example


Back to Preconditions, Revisited. On to Randomized (Unpredictable) Drawing.

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 11 09:03:12 2010.
The source to the document was last modified on Thu Jan 21 13:05:15 2010.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2010S/Outlines/outline.31.html.

You may wish to validate this document's HTML ; Valid CSS! ; Creative Commons License

Samuel A. Rebelsky, rebelsky@grinnell.edu

Copyright © 2007-10 Janet Davis, Matthew Kluber, Samuel A. Rebelsky, and Jerod Weinman. (Selected materials copyright by John David Stone and Henry Walker and used by permission.) This material is based upon work partially supported by the National Science Foundation under Grant No. CCLI-0633090. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation. This work is licensed under a Creative Commons Attribution-NonCommercial 2.5 License. To view a copy of this license, visit 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.