|
![](/i/fill.gif) |
nemesis wrote:
> those are still highly dynamic languages where code optimizations
> through type analysis is very much impossible.
It's not impossible. It just hasn't been applied very much to those
languages yet. You won't get the optimization that Haskell can get, but
you can get much better than people currently get. The trick is to use
run-time information to improve your run-time. Build a table at the
dynamic dispatch sites that run often and cache the lookup results, for
example. There are a number of recent (last year or two, up to next
year) techniques that do a significantly good job, but I can't find the
original article that discussed lots of the recent cutting-edge advances.
One such technique is
http://www.ics.uci.edu/~franz/Site/pubs-pdf/ICS-TR-06-16.pdf
--
Darren New / San Diego, CA, USA (PST)
Post a reply to this message
|
![](/i/fill.gif) |