Sun 4 Nov 2018 15:30 - 15:55 at Stuart - II Chair(s): Adam Welc

Building high performance virtual machines for dynamic languages usually requires significant development effort. They may require an interpreter and one or more compilation phases to generate efficient code. In addition, they may require several static analyses using custom intermediate representation(s). This paper presents techniques used to implement virtual machines for dynamic languages with relatively low development effort and good performance. These techniques allow compiling directly from the abstract syntax tree to target machine code while still enabling useful optimizations and without using any intermediate representation. We have used these techniques to implement a JIT compiler for Scheme. We show that performance of the generated code competes with the code generated by mature Scheme implementations.

Sun 4 Nov

15:30 - 17:05: VMIL 2018 - II at Stuart
Chair(s): Adam WelcUber Technologies
vmil-201815:30 - 15:55
Research paper
Baptiste SaleilUniversité de Montréal, Marc FeeleyUniversité de Montréal
vmil-201815:55 - 16:15
Julien PagèsUniversité de Montréal, Marc FeeleyUniversité de Montréal
vmil-201816:15 - 16:40
Research paper
Baptiste PaugetÉcole Normale Supérieure, David PearceVictoria University of Wellington, Alex PotaninVictoria University of Wellington
DOI Pre-print File Attached
vmil-201816:40 - 17:05
Research paper
Eliot MirandaCadence Design Systems, Clément BéraSofware Languages Lab, Vrije Universiteit Brussel, Elisa Gonzalez BoixVrije Universiteit Brussel, Dan Ingalls