Mobile Haskell: Compiling Lazy Functional Programs for the Java Virtual Machine

This paper shows how lazy functional programs can be made mobile by compiling them for the Java Virtual Machine. The Haskell compiler it describes is based on the h ,Gi-machine, which is designed for implementing lazy functional languages on parallel processors. Although this is not the obvious thing to do, it leads to a particularly elegant set of translation rules. Sadly though, the speed of the resulting Java Virtual Machine code programs is disappointing due to the surprisingly high cost of memory allocation/reclamation in current implementations of the Java Virtual Machine. In future work, we intend to nd out whether this high cost is a property of the Java Virtual Machine's design or its implementation.

• Type: Conference
• Year: 1998
• Where: PLILP
• Authors: David Wakeling
• Keywords: Automated Reasoning, Java Virtual Machine, Lazy Functional Languages, Lazy Functional Programs, PLILP 1998