Burn, G., Hankin, C. and Abramsky, S. (1985) The theory and practice of strictness analysis for higher order functions. Proc. Programs as Data Objects Workshop. Springer-Verlag.
Ernoult, C. and Mycroft, A. (1991) Uniform ideals and strictness analysis. Proc. 18th ICALP, Springer-Verlag Lecture Notes in Computer Science510.
Hudak, P. and Young, J. (1986) Higher order strictness analysis in untyped lambda calculus. Proc. 13th ACM Symp. on Principles of Programming Languages.
Jones, N. D. and Ganzinger, H. (eds.) 1985 Programs as Data Objects: Proc. of a Workshop, Copenhagen, Denmark. Springer-VerlagLecture Notes in Computer Science 215.
Kuo, T.-M. and Mishra, P. (1989) Strictness analysis: a new perspective based on type inference. Proc. Functional Programming and Computer Architecture Conference (ACM-IFIP).
MacQueen, D., Plotkin, G. D. and Sethi, R. (1984) An ideal model for recursive polymorphic types. Proc. 11th ACM Symp. on Principles of Programming Languages.
Milner, R. (1978) A theory of type polymorphism in programming. JCSS.
Mycroft, A. (1981) Abstract interpretation and optimising transformations of applicative programs. PhD thesis, Edinburgh University. (Available as computer science report CST-15-81.)
Mycroft, A. and Jones, N. D. (1985) A relational framework for abstract interpretation. Proc. Programs as Data Objects Workshop. Springer-Verlag.
Mycroft, A. (1993) Completeness and predicate-based abstract interpretation. Proc. ACM Conf. on Partial Evaluation and Program Manipulation.
Young, J. (1989) The theory and the practice semantic program analysis for higher-order functional programming languages. PhD thesis, Department of Computer Science, Yale University. (Available as research report YALEDU/DCS/RR-669.)