Compiling scheme to JVM bytecode: : a performance study

We have added a Java virtual machine (henceforth JVM) bytecode generator to the optimizing Scheme-to-C compiler Bigloo. We named this new compiler BiglooJVM. We have used this new compiler to evaluate how suitable the JVM bytecode is as a target for compiling strict functional languages such as Scheme. In this paper, we focus on the performance issue. We have measured the execution time of many Scheme programs when compiled to C and when compiled to JVM. We found that for each benchmark, at least one of our hardware platforms ran the BiglooJVM version in less than twice the time taken by the Bigloo version. In order to deliver fast programs the generated JVM bytecode must be carefully crafted in order to benefit from the speedup of just-in-time compilers. Categories and Subject Descriptors D.3.1 [Programming Languages]: Language Classifications--applicative (functional) languages; D.3.4 [Program

• Type: Conference
• Year: 2002
• Where: ICFP
• Authors: Bernard P. Serpette, Manuel Serrano
• Keywords: Generated Jvm, ICFP 2002, JVM Bytecode, Programming Languages, Scheme-to-c Compiler Bigloo