Binding-Time Analysis and Strictness Analysis by Abstract Interpretation
| Citations: | 5 - 1 self |
BibTeX
@MISC{Vedrine_binding-timeanalysis,
author = {Franck Vedrine},
title = {Binding-Time Analysis and Strictness Analysis by Abstract Interpretation},
year = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Interpretation Franck V'edrine Laboratoire Informatique de l' ' Ecole Normale Sup'erieure 45 rue d'Ulm, 75230 Paris Cedex 05 FRANCE email: vedrine@dmi.ens.fr Abstract. Given a description of inputs and parameters in a program, a Binding-Time Analysis determines parts of a program which can be evaluated at compile-time. A Strictness Analysis determines parts of a program, whose early evaluation does not change the value of the result. In this paper, we present an analysis which subsumes both analyses for a first-order functional language. The analysis is formulated in terms of Abstract Interpretation based upon approximation of a fixpoint collecting semantics using Galois connections. 1 Introduction Binding-Time Analysis (B.T.A) is useful for partial evaluation. It finds out which parts of a program can be evaluated at compile-time with respect to well known arguments, or more generally, when a dynamic expression can be unfrozen. Combined with Strictness Analysis, it enables to class...
