> Is it theoretically impossible to fit an interpreter for a dynamic programming...

		chriswarbo on April 25, 2017 \| parent \| context \| favorite \| on: Is it really “Complex”? Or did we make it “Complic... > Is it theoretically impossible to fit an interpreter for a dynamic programming language in the L1 cache of a modern chip? The APL, J and K languages are known for being very fast; I vaguely remember one reason being given that their programs are so terse and high-level, they're compact enough to fit in cache. Not sure if the interpreter would though.

Also, apl j k have low interpretation cost, so you're pushing the metal close to its limits.