Fast Strictness Analysis Based on Demand Propagation (1995)
| Venue: | ACM Transactions on Programming Languages and Systems |
| Citations: | 2 - 0 self |
BibTeX
@ARTICLE{Sekar95faststrictness,
author = {R. Sekar and I. V. Ramakrishnan},
title = {Fast Strictness Analysis Based on Demand Propagation},
journal = {ACM Transactions on Programming Languages and Systems},
year = {1995},
volume = {17},
pages = {17--6}
}
OpenURL
Abstract
Interpretation versus Demand Propagation Wadler [1987] uses abstract interpretation over a four-point domain for reasoning about strictness on lists. The four points correspond to undefined list (represented by value 0), infinite lists and lists with some tail undefined (value 1), lists with at least one head undefined (value 2), and all lists (value 3). Burn's work [Burn 1987] on evaluation transformers also uses abstract interpretation on the above-mentioned domain for strictness analysis. He defines four evaluators that correspond to the four points mentioned above in the sense that the ith evaluator will fail to produce an answer when given a list with the abstract value i \Gamma 1.







