ML Type Inference for Dead Code Analysis (1997)
| Citations: | 2 - 2 self |
BibTeX
@MISC{Prost97mltype,
author = {Frédéric Prost and Ecole Normale and Suprieure Lyon},
title = {ML Type Inference for Dead Code Analysis},
year = {1997}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We propose to adapt ML type inference algorithm to find and erase dead-code in simply typed -terms. We prove the correctness of our optimization: the optimized program is observationally equivalent to the original one. This paper also sheds new lights on links between typing and static analyses, in the particular case of dead code analysis. Indeed, the same algorithm can be used both for typing and dead-code analysis. Moreover, it appears new to the author that ML type inference can be used to represent links as encountered in data flow analyses. Keywords: ML Type Inference, Dead-Code Analysis, Polymorphism, Extraction R'esum'e Nous proposons d'adapter l'algorithme d'inf'erence de type de ML pour trouver et effacer le code mort de -termes simplement typ'es. Nous prouvons la correction de notre optimisation: le programme optimis'e est observationnellement 'equivalent `a l'original. Ce papier 'eclaire d'une mani`ere nouvelle les liens entre le typage et l'analyse statique, d...
