1997
DOI: 10.1145/258128.258212
|View full text |Cite
|
Sign up to set email alerts
|

On the power and limitations of strictness analysis

Abstract: Strictness analysis is an important technique for optimization of lazy functional languages. It is well known that all strictness analysis methods are incomplete, i.e., fail to report some strictness properties. In this paper, we provide a precise and formal characterization of the loss of information that leads to this incompleteness. Specifically, we establish the following characterization theorem for Mycroft's strictness analysis method and a generalization of this method, called ee-analysis, that reasons … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1997
1997
2000
2000

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…Laziness annotations can beprovided by a strictness analyzer, in which case all arguments that are not found to be strict get the annotation lazy, or by a programmer. In practice strictness analyzers can be conservative beasts, so that they may indicate far too many lazy arguments; see e.g., 49 .…”
Section: Introductionmentioning
confidence: 99%
“…Laziness annotations can beprovided by a strictness analyzer, in which case all arguments that are not found to be strict get the annotation lazy, or by a programmer. In practice strictness analyzers can be conservative beasts, so that they may indicate far too many lazy arguments; see e.g., 49 .…”
Section: Introductionmentioning
confidence: 99%