Path: utzoo!attcan!uunet!yale!Krulwich-Bruce
From: Krulwich-Bruce@cs.yale.edu (Bruce Krulwich)
Newsgroups: comp.lang.scheme
Subject: Re: Limitation with lambda
Keywords: lambda
Message-ID: <40640@yale-celray.yale.UUCP>
Date: 18 Oct 88 21:06:11 GMT
References: <15590@agate.BERKELEY.EDU>
Sender: root@yale.UUCP
Reply-To: Krulwich-Bruce@cs.yale.edu (Bruce Krulwich)
Organization: Computer Science, Yale University, New Haven, CT 06520-2158
Lines: 14
In-reply-to: 128a-3aj@e260-3b.berkeley.edu (Jonathan Dubman)

In article <15590@agate.BERKELEY.EDU>, 128a-3aj@e260-3b (Jonathan Dubman)
writes:
>There seems to be a gross omission in the lambda primitive.  It seems like
>there is no way to create a recursive function on the fly!  I'm reading
>the Abelson and Sussman book but they seem to avoid this issue.

While this may be theoretically true, it seems trivial to me to just make a
LAMBDA-function with a LETREC, where the body of the LETREC is just a call to
the (recursive) function defined in the LETREC.

Whether this solves the particular problem you described, I don't know.


Bruce Krulwich