🚀 go-pugleaf

stephen@estragon.uchicago.edu (Stephen P Spackman) writes:

> DYNAMIC typing uses tags always

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

	It seems to me that a language with a good type inference
algorithm and optional type constraints provided by the programmer
should be able to do this in many cases, eliminating type tags when
they aren't necessary.  If you're a static typing fan, you tell the
compiler to whine at you if it can't optimize out all type tags at
compile time, and you have to provide extra type information to get
the code to compile.

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

Nix Thompson		nix@sgi.com		...!uunet!sgi!nix

	  follow the black valley - trail of death
		into the beautiful sunshine.