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 _________________________________________________ For list-related administrative tasks: http://lists.racket-lang.org/listinfo/users
