[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Comparing functions
- To: "Steve Bacher (Batchman)" <SEB1525%draper.com@NSS.Cs.Ucl.AC.UK>, firstname.lastname@example.org
- Subject: Re: Comparing functions
- From: Jeff Dalton <jeff%aiai.edinburgh.ac.uk@NSS.Cs.Ucl.AC.UK>
- Date: Thu, 8 Sep 88 15:50:07 BST
- In-reply-to: Steve Bacher (Batchman)'s message of Thu, 8 Sep 88 07:47 EDT
> From: CCFVX3::SEB1525 "Steve Bacher (Batchman)" 8-SEP-1988 07:30
> To: IN%"email@example.com.UK",SEB1525
> Subj: RE: Re: Implementing :TEMPORARY hash tables at the Lisp level?
> Well, as was already pointed out, an implementation may be creating new
> objects every time #' is done, and it may not be trivial to optimize this
> on the part of the compiler. There's gotta be a better way...
I think it *is* trivial to optimize #'F when F is a symbol. Simply
return the value of F in the function namespace: this function should
already exist and should not have to be copied or remade.
Comparison between different results of #'(LAMBDA ...), however, will
always be problematic because we want to allow certain optimizations
which will depend on what side-effects occur in the lambda-expression
and because it is not possible to compare arbitrary functions in general.