1. Abramsky, S., and Hankin, C.Abstract Interpretation of Declarative Languages, Ellis Horwood, 1987.
2. Bloss, A.Path Analysis: Using Order-of-Evaluation Information to Optimize Lazy Functional Languages, Ph.D. thesis, Department of Computer Science, Yale University, New Haven, CT, 1988.
3. Bloss, A., and Hudak, P. Path semantics. InProceedings, Third Workshop on the Mathematical Foundations of Programming Language Semantics, Springer-Verlag LNCS, April 1987.
4. Burn, G. L., Hankin, C. L., and Abramsky, S. The theory of strictness analysis for higher order functions. InLNCS 217: Programs as Data Objects, Springer-Verlag, New York, 1985, pp. 42–62.
5. Cousot, P., and Cousot, R. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In4th ACM Sym. on Prin. of Prog. Lang., ACM, 1977, pp. 238–252.