[racket] a small programming exercise

From: Shriram Krishnamurthi (sk at cs.brown.edu)
Date: Thu Oct 14 12:30:00 EDT 2010

Why doesn't that impact regular Run?  Because all the things that look
normal (define, cond, etc.) are going through many, many more layers
of macros provided by TR?  Is there a non-linear expansion?


On Thu, Oct 14, 2010 at 12:20 PM, Matthias Felleisen
<matthias at ccs.neu.edu> wrote:
> On Oct 14, 2010, at 12:18 PM, Shriram Krishnamurthi wrote:
>> It would seem TR should not take much longer than regular Run.  (I'm
>> not aware of it performing any sophisticated non-linear
>> interprocedural computations, which would serve as an *intrinsic*
>> cause for significant delay.)  I presume this gap is caused by what
>> you're calling the absence of an "optimistic make".
>> If the two times could be made similar, I don't think there'd need for
>> any of this fanciness (with the attendant complexity, potential for
>> bugs, etc).
>> Is the delay in TR in any way related to the fact Check Syntax also
>> takes a while to run -- imo, much longer than one might like?  (Though
>> there, the coloring of the buffer and creation of arrows, etc., may
>> also have an impact...but again, for small programs?)
>> Shriram
> Yes, macro expansion is slow. -- Matthias

Posted on the users mailing list.