Time Analysis, Cost Equivalence and Program Refinement

Techniques for reasoning about extensional properties of functional programs are wellunderstood, but methods for analysing the underlying intensional, or operational properties have been much neglected. This paper presents the development of a simple but practically useful calculus for time analysis of non-strict functional programs with lazy lists.

[1]  Simon L. Peyton Jones,et al.  The Implementation of Functional Programming Languages , 1987 .

[2]  S. Abramsky.  The lazy lambda calculus , 1990 .

[3]  Carolyn L. Taylor.  The Essence of Rum: A Theory of the Intensional and Extensional Aspects of Lisp-Type Computation, , 1985 .

[4]  David Sands,et al.  Calculi for time analysis of functional programs , 1990 .

[5]  Marko C. J. D. van Eekelen,et al.  Term Graph Rewriting , 1987, PARLE.

[6]  Zena M. Ariola,et al.  A syntactic approach to program transformations , 1991, PEPM '91.

[7]  David Sands.  Complexity Analysis for a Lazy Higher-Order Language , 1990 .

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

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

[10]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

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

[12]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[13]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

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

[15]  Harold T. Hodes,et al.  The | lambda-Calculus. , 1988 .

[16]  Douglas J. Howe.  Equality in lazy computation systems , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

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

[18]  Daniel Le Métayer,et al.  ACE: an automatic complexity evaluator , 1988, TOPL.

[19]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

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

[21]  Carolyn L. Talcott,et al.  1 Equivalence in Functional Languages with E ectsIan , 2007 .

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

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

[24]  Chris Hankin,et al.  The theory and practice of strictness analysis for higher order functions , 1985 .