Held: Wednesday, 12 February 2003
Summary: Today we begin to consider one of the most powerful tools in Scheme, recursion. Recursion allows you to repeat operations.
click hereby folks even more opinionated than I.
lengthprocedure does not exist.
(define proc (lambda (val) (if (base-case-test) (base-case val) (combine (partof val) (proc (update val))))))
(define proc (lambda (lst) (if (null? lst) null-case (combine (onestep (car val)) (proc (cdr val))))))
Thursday, 16 January 2003 [Samuel A. Rebelsky]
Wednesday, 12 February 2003 [Samuel A. Rebelsky]
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:29:45 2003.
The source to the document was last modified on Wed Feb 12 09:34:36 2003.
This document may be found at