The effectiveness of type-based unboxing

We compare the efficiency of type-based unboxing strategies with that of simpler, untyped unboxing optimizations, building on our practical experience with the Gallium and Objective Caml compilers. We find the untyped optimizations to perform as well on the best case and significantly better in the worst case.

[1]  Richard C. H. Connor,et al.  An ad hoc approach to the implementation of polymorphism , 1991, TOPL.

[2]  Manuel Serrano,et al.  Control ow analysis : a compilation paradigm for functional languageManuel , 1995 .

[3]  Xavier Leroy,et al.  Unboxed objects and polymorphic typing , 1992, POPL '92.

[4]  Jean Goubault,et al.  Generalized boxings, congruences and partial inlining , 1994 .

[5]  Olin Shivers,et al.  Control flow analysis in scheme , 1988, PLDI '88.

[6]  Andrew P. Tolmach.  Tag-free garbage collection using explicit type parameters , 1994, LFP '94.

[7]  James E. Hicks,et al.  Garbage collection for strongly-typed languages using run-time type reconstruction , 1994, LFP '94.

[8]  Greg Morrisett,et al.  Compiling with Types , 1995 .

[9]  Marc Feeley,et al.  Storage use analysis and its applications , 1996, ICFP '96.

[10]  Andrew P. Tolmach,et al.  From ML to Ada: Strongly-typed language interoperability via source translation , 1998, Journal of Functional Programming.

[11]  Andrew W. Appel,et al.  A type-based compiler for standard ML , 1995, PLDI '95.

[12]  Simon L. Peyton Jones,et al.  Unboxed Values as First Class Citizens in a Non-Strict Functional Language , 1991, FPCA.

[13]  Andrew W. Appel,et al.  Runtime tags aren't necessary , 1989, LISP Symb. Comput..

[14]  Atsushi Ohori,et al.  An Unboxed Operational Semantics for ML Polymorphism , 1997, LISP Symb. Comput..

[15]  Zhong Shao.  Flexible representation analysis , 1997, ICFP '97.