Towards automatic construction of staged compilers

Some compilation systems, such as offline partial evaluators and selective dynamic compilation systems, support staged optimizations. A staged optimization is one where a logically single optimization is broken up into stages, with the early stage(s) performing preplanning set-up work, given any available partial knowledge about the program to be compiled, and the final stage completing the optimization. The final stage can be much faster than the original optimization by having much of its work performed by the early stages. A key limitation of current staged optimizers is that they are written by hand, sometimes in an ad hoc manner. We have developed a framework called the Staged Compilation Framework (SCF) for systematically and automatically converting single-stage optimizations into staged versions. The framework is based on a combination of aggressive partial evaluation and dead-assignment elimination. We have implemented SCF in Standard ML. A preliminary evaluation shows that S...

• Type: Conference
• Year: 2002
• Where: POPL
• Authors: Matthai Philipose, Craig Chambers, Susan J. Eggers
• Keywords: Ad Hoc Manner, Final Stage, Offline Partial Evaluators, POPL 2002, Programming Languages