Strictness analysis aids time analysis

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn Part F130193, Issue , 1988, Pages 119-132

  Wadler, Philip ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORMALISATION; FUNCTIONAL PROGRAMS; LAZY LANGUAGES; STRICTNESS ANALYSIS; TIME ANALYSIS; TIME COMPLEXITY;

EID: 85034047867     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/73560.73571     Document Type: Conference Paper

References (9)

1. S. Abramsky, C. Hankin. Abstract Interpretation of Declarative Languages. Ellis Horwood 1987, to appear.
2. B. Bjerner. Complexity analysis of programs in type theory. Programming Methodology Group, Chalmers University of Technology, Goteborg, Sweden, 1987.
3. R. J. M. Hughes. Strictness detection in non-flat domains. In N. Jones and H. Ganzinger, editors, Workshop on Programs as Data Objects, Springer-Verlag, Copenhagen, October 1985. LNCS 217.
4. R. J. M. Hughes. Backwards analysis of functional programs. University of Glasgow research report CSC/87/R3, March 1987.
5. C. V. Hall and D. S. Wise. Compiling strictness into streams. In 14'th ACM Symposium on Principles of Programming Languages, pages 132-143, Munich, January 1987.
6. D. Le Metayer. Mechanical analysis of program complexity. In ACM SIGPLAN Symposium on Language Issues in Programming Environments, Seattle, Washington, June 1985.
7. S. L. Peyton Jones. Implementing Functional Languages using Graph Reduction. Prentice-Hall, 1987.
8. P. L. Wadler and R. J. M. Hughes. Projections for strictness analysis. In S'rd International Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, September 1987.
9. B. Wegbreit. Mechanical program analysis. Communications of the ACM, 18(9): 528-539, September 1975.