🚀 go-pugleaf

Stephen P Spackman
> > DYNAMIC typing uses tags always

Nix Thompson		
> ... unless the typing can be completely determined at compile time,
> and the tags can be optimized out.

> Is there any reason why this can't be done?  Are there any
> "dynamically typed" languages that do this?

The compiler I use does this almost all the time.  However, it is
mostly used for compiling "leaf" functions to be used in an
interpreted environment.  Basically, its only purpose is to cut out
interpreter overhead (including type-checking) for problems that
involve a lot of little operations on the same piece of data.

The interpreter has better performance in other problem domains.
(the sort of optimizations compilers do IS a tradeoff...).

Raul Rockwell