Held: Tuesday, 18 February 2003
Summary: Today we continue our investigations into higher-order procedures by grounding our discussion in further hands-on activities.
(define left-section (lambda (binproc left-param) (lambda (right-param) (binproc left-param right-param))))
sum. We might define it as
(define sum (lambda (val1) (lambda (val2) (+ val1 val2))))
(define filter (lambda (pred?) (letrec ((recurrer (lambda (lst) (cond ((null? lst) null) ((pred? (car lst)) (recurrer (cdr lst))) (else (cons (car lst) (recurrer (cdr lst)))))))) recurrer)))
(define filter-odd (filter odd?))
Thursday, 15 January 2003 [Samuel A. Rebelsky]
Monday, 17 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:20:33 2003.
The source to the document was last modified on Mon Feb 17 19:52:29 2003.
This document may be found at