The Java Virtual Machine (JVM) was designed as the target for Java compilers, but there is no reason why it cannot be used as the target for other languages. We describe the implementation of a compiler which translates a lazy, weakly-typed functional program into Java class files. We compare the pe
Compiling almost-whole Java programs
✍ Scribed by Zoran Budimlić; Ken Kennedy
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 180 KB
- Volume
- 17
- Category
- Article
- ISSN
- 1532-0626
- DOI
- 10.1002/cpe.850
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We show how a simple but important class of recursive logic programs can be mechanically transformed to take advantage of the associativity of auxiliary relations. This often results in improved efficiency through the introduction of tail recursion. We give proofs of correctness both for the transfo
We describe a new approach to programming distributed-memory computers. Rather than having each node in the system explicitly programmed, we derive an efficient message-passing program from a sequential shared-memory program annotated with directions on how elements of shared arrays are distributed
We motivate and describe the design and implementation of a system for compiling the highlevel programming language NESL into Java. As well as increasing the portability of NESL, this system has enabled us to make existing simulations and algorithm animations available in applet form on the Web. We
This paper describes the prototype restructuring compiler javar, which can be used to make implicit parallelism in a Java program explicit by means of multi-threading. Although the prototype does not provide a complete Java front-end (unicode escapes are not supported and only limited semantic analy