论文信息 - Measuring the effectiveness of a simple strictness analyser

Measuring the effectiveness of a simple strictness analyser

We describe a simple strictness analyser for purely-functional programs, show how its results are used to improve programs, and provide measurements of the effects of these improvements. These measurements are given both in terms of overall run-time, and in terms of internal operations such as allocations, updates, etc.

Simon Peyton Jones | Will Partain

[1] Chris Hankin,et al. Strictness Analysis for Higher-Order Functions , 1986, Sci. Comput. Program..

[2] Simon L. Peyton Jones,et al. Unboxed Values as First Class Citizens in a Non-Strict Functional Language , 1991, FPCA.

[3] Marinus J. Plasmeijer,et al. Generating Efficient Code for Lazy Functional Languages , 1991, FPCA.

[4] Alex Ferguson,et al. A Loop-Detecting Interpreter for Lazy, Higher-Order Programs , 1992, Functional Programming.

[5] Christopher D. Clack,et al. Finding fixpoints in abstract interpretation , 1987 .

[6] Geoffrey L. Burn,et al. Using Strictness in the STG Machine , 1993, Functional Programming.

[7] Geoffrey L. Burn,et al. Assessing the evaluation transformer model of reduction on the spineless G-machine , 1993, FPCA '93.

[8] John Launchbury,et al. Unboxed values as first class citizens , 1991 .

[9] Cordelia V. Hall. A framework for optimising abstract data types , 1993, Functional Programming.

[10] Geoffrey L. Burn,et al. The Evaluation Transformer Model of Reduction and Its Correctness , 1991, TAPSOFT, Vol.2.

[11] Philip Wadler,et al. Projections for strictness analysis , 1987, FPCA.