Strictness and Totality Analysis

@article{Gasser1998StrictnessAT,
  title={Strictness and Totality Analysis},
  author={Kirsten Lackner Solberg Gasser and Hanne Riis Nielson and Flemming Nielson},
  journal={Sci. Comput. Program.},
  year={1998},
  volume={31},
  pages={113-145}
}
Strictness analysis has proved useful in the implementation of lazy functional languages like Miranda, Lazy ML and Haskell: when a function is strict it is safe to evaluate its argument before performing the function call. In the literature there are several approaches to the specification of strictness analysis: abstract interpretation (e.g. [12,3]), projection analysis (e.g. [21]), and inference based methods (e.g. [2,6,8,9,22]).