Strictness Analysis Aids Time Analysis

@inproceedings{Wadler1988StrictnessAA,
  title={Strictness Analysis Aids Time Analysis},
  author={Philip Wadler},
  booktitle={POPL},
  year={1988}
}
Analyzing time complexity of functional programs in a lazy language is problematic, because the time required to evaluate a function depends on how much of the result is “needed” in the computation. Recent results in strictness analysis provide a formalisation of this notion of “need”, and thus can be adapted to analyse time complexity. The future of programming may be in this paradigm: to create software, first write a specification that is clear, and then refine it to an implementation that… CONTINUE READING