On the power of abstract interpretation

Abramsky, 1987 Debray, 1989, Static inference of modes and data dependencies in logic programs, ACM Transact. Program. Lang. Systems, 11, 418, 10.1145/65979.65983 Mycroft, 1980, The theory and practice of transforming call-by-need into call-by-value, 269 Mycroft, 1981, Abstract Interpretation and Optimising Transformations for Applicative Programs Sekar, 1991, On the power and limitation of strictness analysis based on abstract interpretation, 37 Sekar, 1990, Small domains spell fast strictness analysis, 169 Wadler, 1987, Strictness analysis on non-flat domains (by abstract interpretation over finite domains) Burn, 1985, The theory of strictness analysis for higher order functions, 42 Abramsky, 1990, Abstract interpretation, logical relations, and kan extensions, J. Logic Computat., 1, 5, 10.1093/logcom/1.1.5 Hunt, 1990, PERs generalise projections for strictness analysis Nielson, 1985, Expected forms of data flow analyses, 172 Damas, 1982, Principal type-schemes for functional programs, 207 Mitchell, 1988, The essence of ML, 28 Mitchell, 1990, Type systems for programming languages, Vol. B, 365 Statman, 1985, Logical relations and the typed lambda calculus, Inf. Control, 65, 85, 10.1016/S0019-9958(85)80001-2 Kamin, 1992, Head-strictness is not a monotonic abstract property, Inform. Processing Lett., 41, 195, 10.1016/0020-0190(92)90179-Y Wadler, 1987, Projections for strictness analysis, 385