0 -- strenghed
the strictness of the regulations.
Although it is rarely clearly stated, we implicitly have a predicate whose result tells us when an abstract value permits strictness optimisations.
Using partial projections we will introduce strictness behaviour, and propagate it through the program by the projection analysis.
In particular, strictness annotations that may accompany the declaration of a data constructor are not apparent in the concrete syntax of a constructor application.
We provide an abstract semantics based on partial projections which defines a strictness analysis.
Below we present results obtained by the strictness analysis defined above.
In previous formulations of projection strictness analysis, the two forms of demand were confused (literally) by the lifting trick.
The strictness premise is necessary because # is strict in its first argument.
This is contrary to most strictness analysers, where the strictness property of an expression has to be computed anew whenever one of its subexpressions changes.
