Given that Unix won , I think it's interesting that dynamic languages make very little use of the dynamic linking and loading infrastructure provided by modern free Unixes such as Linux and the BSDs.
Most dynamic PLs opt to implemenent "dynamism" (i.e. redefining stuff, loading code at runtime) with application-specific data structures (e.g.
Lisp: red-black trees for uniquifying symbols, function pointers and indirect function calls ), and they do so solely at runtime (mostly using interpreters and...
Bytecodes meet Combinators: invokedynamic on the JVM
Bytecodes meet Combinators: invokedynamic on the JVM. John Rose. VMIL'09. The Java Virtual Machine (JVM) has been widely adopted in part because of its classfile format, which is portable,...
Fully-parameterized, first-class modules with...
Fully-parameterized, first-class modules with hygienic macros, dissertation by Martin Gasbichler, 2006. It is possible to define a formal semantics for configuration, elaboration, linking,...
Twilight of the GPU
This interview with Tim Sweeney discusses his prediction that graphic rendering will move from special purpose GPUs back to the CPU: I expect that in the next generation we'll write 100...
Post new comment