1. Samson Abramsky. Strictness analysis and polymorphic invariance (extended abstract). In H. Ganzinger and N. Jones, editors, Proceedings of the Workshop on Programs as Data Objects, Copenhagen, volume 217 of Lecture Notes in Computer Science, pages 1–23. Springer-Verlag, October 1985.
2. Samson Abramsky. Domain theory in logical form. Annals of Pure and Applied Logic, 51(1–2):1–78, 1991.
3. Samson Abramsky and Thomas P. Jensen. A relational approach to strictness analysis of higher order polymorphic functions. In Proceedings of ACM Symposium on Principles of Programming Languages, 1991.
4. P. N. Benton. Static Analyses and Optimising Transformations for Lazy Functional Programs. PhD thesis, University of Cambridge, 1992. in preparation.
5. Geoffrey L. Burn, Chris L. Hankin, and Samson Abramsky. The theory of strictness analysis for higher order functions. In H. Ganzinger and N. Jones, editors, Proceedings of the Workshop on Programs as Data Objects, Copenhagen, volume 217 of Lecture Notes in Computer Science. Springer-Verlag, October 1985.