Tail call elimination on the Java Virtual Machine (2001) [13 citations — 0 self]
by
Michel Schinz
,
Martin Odersky
In Proc. ACM SIGPLAN BABEL’01 Workshop on Multi-Language Infrastructure and Interoperability
Add To MetaCart
Abstract:
A problem that often has to be solved by compilers for functional languages targeting the Java Virtual Machine is the elimination of tail calls. This paper explains how we solved it in our Funnel compiler and presents some experimental results about the impact our technique has on both performance and size of the compiled programs.
Citations
| 3853 | Design Patterns: Elements of Reusable Object-Oriented Software – Gamma, Helm, et al. - 1995 |
| 911 | The Java Virtual Machine Specification – Lindholm, Yellin - 1997 |
| 89 | Compiling Standard ML to Java bytecodes – BENTON, KENNEDY, et al. |
| 49 | No assembly required: Compiling Standard ML to C – Tarditi, Acharya, et al. - 1990 |
| 29 | Functional Nets – Odersky |
| 9 | Compiling lazy functional programs for the Java virtual machine – Wakeling - 1999 |
| 4 | The Kawa Scheme system – Bothner - 1997 |
| 3 | should not CONS its arguments, part II – CONS - 1994 |
| 2 | Funnel compiler release 8. http:// lampwww. epfl. ch/funnel – Zenger, Schinz |
| 1 | internals: Compiling Scheme to Java. http://wm,.gnu. org/software/kawa/internals.html – Kawa - 1998 |
| 1 | Adaptive optimization for Self: Reconciling High Performance with Exploratory Programming – H51zle - 1994 |

