[plt-scheme] Tree recursion

From: Robby Findler (robby at cs.uchicago.edu)
Date: Wed Jan 23 15:59:44 EST 2008

On Jan 23, 2008 2:54 PM, Grant Rettke <grettke at acm.org> wrote:
> On Jan 22, 2008 9:29 PM, Robby Findler <robby at cs.uchicago.edu> wrote:
> > You can try thinking about it algebraically. Each equality below
> > corresponds to using the tree-copy just one time (well, except once
> > where I took two steps at once).
> I see, that makes sense. Thanks!
> Is that was folks refer to as the conceptual "substitution module" of
> evaluation?

Yes, I suppose so. I certainly used substitution for function
application (plus rules for car and cdr and whatnot).


Posted on the users mailing list.