Given a syntax tree representing an expression, and some information regarding that expression, a backwards analysis will involve propagating the information (with appropriate transformation) towards the leaves of the tree, to yield information about the subexpressions. Here, the information at the root will describe the required definedness of the value of the expression, with the results of the analysis describing the definedness of the values lower in the tree sufficient or necessary to meet the condition at the root. In Projections for Strictness Analysis , such an analysis is described in which the information at each node is encoded by a special kind of function called a projection, with the results of the analysis revealing strictness information about the expression. This paper describes a more general and powerful technique, and provides proofs that both techniques meet a corresponding generalisation of the safety condition described in .
|Title of host publication||Functional Programming|
|Subtitle of host publication||Proceedings of the 1989 Glasgow Workshop 21–23 August 1989, Fraserburgh, Scotland|
|Number of pages||19|
|Publication status||Published - 1989|
|Name||Workshops in Computing|