Re: Optimizing simple calls in a dynamically typed language?

On Sep 4, 8:54 pm, Eliot Miranda <eli...@pacbell.net> wrote:
> >> double v1, v2;
> >> if (fastToNumber(x, v1) && fastToNumber(y, v2)) z = v1 * v2;
> >> else { slow path with virtual calls, exception checks, etc }
>
> > Do you know of any papers detailing the fast algorithms to do this?
>
> Read the Smalltalk and Self implementation papers. Deutsch-Schiffmann
> is the classic Smalltalk paper. There is some good stuff in
> Smalltalk-80: Bits of History, Words of Advice. The Self papers are
> on-line at Sun. There is some stuff around on Strongtalk which is a
> more-or-less direct ancestor of v8 (the Chrome JavaScript). Both
> Strongtalk and v8 were written by Lars Bak (along with others).


Thanks for pointing out the papers on Self. I remember doing a search
on Self that turned out very little useful material, but this time I
struck gold (http://research.sun.com/self/papers/papers.html if anyone
else wants to know).


The type inference algoritms were especially straightforward and
instructive.


However, I had less luck finding useful Strongtalk papers. Any links?


/C

Return to the comp.compilers page.
Search the comp.compilers archives again.