Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

POPL

1999

ACM

1999

ACM

Superﬂuous variables are often produced as the byproducts of program transformations, compilation, and poorly written code. These variables are irrelevant to the computational outcome of their programs. Eliminating them as a means of higherlevel optimization may increase program execution speed. This paper explores an implementation of Wand and Siveroni’s algorithm for useless variable elimination. The algorithm is shown to remove superﬂuous variables that are accessed, updated, and passed between functions, as well as collapse let expressions when all the let expression’s variables are superﬂuous. The algorithm does not preserve non-termination nor remove variables whose contributions are constant.

Related Content

Added |
03 Aug 2010 |

Updated |
03 Aug 2010 |

Type |
Conference |

Year |
1999 |

Where |
POPL |

Authors |
Mitchell Wand, Igor Siveroni |

Comments (0)