Re: Efficiency of local fns and closures

[bouma@PURDUE.EDU]

     Consider:

     a) In general, are local functions any slower w.r.t. a global fn definit
no
        I.e. is there any reason to expect BAR to run faster if it were defin
no
     b) Does the presence of the lexically-apparent free reference to 'y'
no
        If free ocurrence of 'y' slows down BAR, can that be avoided by
no
     c) I have read that closures cannot be compiled.  True? False?

I'd start reading something else.

Bill <bouma@cs.purdue.edu>