Held: Thursday, 25 September 2003
Summary: Today we continue our investigation of recursion over lists by conducting a number of experiments.
patternone uses to design certain kinds of procedures.
(define proc (lambda (val) (if (base-case-test) (base-case val) (combine (partof val) (proc (simplify val))))))
(define proc (lambda (lst) (if (null? lst) null-case (combine (onestep (car lst)) (proc (cdr lst))))))
(define proc (lambda (lst) (if (null? (cdr lst)) singleton-case (combine (onestep (car lst)) (proc (cdr lst))))))
Thursday, 28 August 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 Dec 9 13:59:40 2003.
The source to the document was last modified on Mon Sep 1 13:30:51 2003.
This document may be found at