Its an interesting read. Lua seems pretty sweet!
You'd be amazed at the sorts of aggressive optimizations that can be done at compile-time.
If the symbols are "hard linked", it is not dynamic anymore.
I wonder what strategy the LISP dialects out there typically use? I was impressed how easy it is to create an object system in a LISP, but somewhat dismayed because all examples just used (cond) for symbol lookup. Maybe because they were just academic examples, or perhaps they really don't care about performance at all?
Lies, slander! ;-)
Anything that happens within a function can be treated as a black box, and compiled down to the metal, if you like.
The language can be as dynamic as you like; that doesn't preclude the output format from being tightly optimized machine code.
You can know that, e.g. a function passed in as an argument can be dereferenced as a pointer stored in a specific offset on the stack.
If your typechecks are compiler-generated statements inserted before a function call, then if you know at compile-time (via declarations or type inference, or type propagation) that a certain variable (to be passed as an argument) will always be of the correct type T, then you can omit the typecheck, as well as boxing/tagging.
You can get really close to the metal this way, and still have your language be as dynamic as can be.