论文信息 - Tail call elimination on the Java Virtual Machine

Tail call elimination on the Java Virtual Machine

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.

Martin Odersky | Michel Schinz

[1] Nick Benton,et al. Compiling standard ML to Java bytecodes , 1998, ICFP '98.

[2] Martin Odersky,et al. An Overview of Functional Nets , 2000 .

[3] Frank Yellin,et al. The Java Virtual Machine Specification , 1996 .

[4] David Wakeling,et al. Compiling lazy functional programs for the Java Virtual Machine , 1999, Journal of Functional Programming.

[5] Henry G. Baker,et al. CONS should not CONS its arguments, part II: Cheney on the M.T.A. , 1995, SIGP.

[6] Urs Hölzle,et al. Adaptive optimization for self: reconciling high performance with exploratory programming , 1994 .

[7] G BakerHenry. CONS should not CONS its arguments, part II , 1995 .

[8] Peter Lee,et al. No assembly required: compiling standard ML to C , 1992, LOPL.

[9] Ralph Johnson,et al. design patterns elements of reusable object oriented software , 2019 .