论文信息 - Complexity Analysis for a Lazy Higher-Order Language

Complexity Analysis for a Lazy Higher-Order Language

This paper is concerned with the time-analysis of functional programs. Techniques which enable us to reason formally about a program’s execution costs have had relatively little attention in the study of functional programming. We concentrate here on the construction of equations which compute the time-complexity of expressions in a lazy higher-order language.

David Sands

[1] Ben Wegbreit,et al. Mechanical program analysis , 1975, CACM.

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

[3] S. Holmström,et al. A composition approach to time analysis of first order lazy functional programs , 1989, FPCA.

[4] Daniel Le Métayer. Mechanical analysis of program complexity , 1985, ACM SIGPLAN Notices.

[5] Geoffrey L. Burn. A relationship between abstract interpretation and projection analysis , 1989, POPL '90.

[6] Mads Rosendahl,et al. Automatic complexity analysis , 1989, FPCA.

[7] Chris Hankin,et al. Abstract Interpretation of Declarative Languages , 1987 .

[8] Gilles Kahn,et al. Natural Semantics , 1987, STACS.

[9] Jacques Cohen,et al. Automating program analysis , 1988, JACM.

[10] Philip Wadler,et al. Strictness analysis aids time analysis , 1988, POPL '88.

[11] Philip Wadler,et al. Backwards Strictness Analysis: Proved and Improved , 1989, Functional Programming.