Flow analysis of lazy higher-order functional programs

Theoretical Computer Science

Volumn 375, Issue 1-3, 2007, Pages 120-136

  Jones, Neil D ^a   Andersen, Nils ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Collecting semantics; Higher order program; Lazy evaluation; Program flow analysis; Reynolds analysis of applicative LISP programs Term rewriting system; Tree grammar

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; SEMANTICS; TREES (MATHEMATICS);

DATA OBJECTS; HIGHER-ORDER PROGRAM; LAZY EVALUATION; PROGRAM FLOW ANALYSIS; REYNOLDS ANALYSIS OF APPLICATIVE LISP PROGRAMS TERM REWRITING SYSTEM; TREE GRAMMAR;

COMPUTER PROGRAMMING;

EID: 34047122198     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.12.030     Document Type: Article

References (36)

1. Abel A. Termination checking with types. Fixed Points in Computer Science FICS'03. RAIRO - Theoretical Informatics and Applications 38 4 (2004) 277-319 (special issue)
2. Abramsky S., and Hankin C. Abstract Interpretation of Declarative Languages (1987), Ellis Horwood
3. Aho A. Currents in the Theory of Computing (1973), Prentice-Hall
4. Brainerd W.S. Tree generating regular systems. Information and Control 13 (1969) 217-231
5. G.L. Burn, C.L. Hankin, S. Abramsky, The theory of strictness analysis for higher-order functions, in: [9], 1986, pp. 42-62
6. P. Cousot, Semantic foundations of program analysis, in: [25], 1981, pp. 303-342
7. P. Cousot, R. Cousot, Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixpoints, in: POPL '77: 4th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1977, pp. 238-252
8. Dijkstra E. A Discipline of Programming (1976), Prentice-Hall
9. In: Ganzinger H., and Jones N. (Eds). Programs as Data Objects. Lecture Notes in Computer Science vol. 217 (1986), Springer-Verlag
10. Gécseg F., and Steinby M. Tree Automata (1984), Akademiai Kiado, Budapest
11. J. Giesl, R. Thiemann, P. Schneider-Kamp, Proving and disproving termination of higher-order functions, Technical report, RWTH Aachen, 2005
12. Hecht M. Flow Analysis of Computer Programs (1977), North-Holland
13. N. Heintze, Set based program analysis, Ph.D. Thesis, Carnegie-Mellon Univ., Pittsburgh, PA, 1992
14. G. Huet, J.J. Lévy, Call by need computations in nonambiguous linear term rewriting systems, Technical report, INRIA, France, 1979
15. J. Hughes, Strictness detection in non-flat domains, in: [9], 1986, pp. 112-135
16. S. Jagannathan, S. Weeks, A unified treatment of flow analysis in higher-order languages, in: POPL '95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995, pp. 393-407
17. Johnsson T. Lambda lifting: Transforming programs to recursive equations. Proceedings IFIP Symposium on Functional Programming Languages and Computer Architecture. Lecture Notes in Computer Science vol. 201 (1985)
18. Jones N.D. Flow analysis of lambda expressions. Proceedings of ICALP 1981. Lecture Notes in Computer Science vol. 115 (1981)
19. N.D. Jones, Flow analysis of lazy higher-order functional programs, in: [2], 1987, pp. 103-122
20. N.D. Jones, S.S. Muchnick, Flow analysis and optimisation of LISP-like structures, in: POPL '79: 6th ACM SIGPLAN-SIGACT, Symposium on Principles of Programming Languages, 1979, pp. 244-256
21. N.D. Jones, A. Mycroft, Data flow analysis of applicative programs using minimal function graphs, in: POPL '86: 13th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1986, pp. 296-306
22. Jones N.D., and Rosendahl M. Higher-order minimal function graphs. Journal of Functional and Logic Programming 2 (1997)
23. Jones N.D., Sestoft P., and Sondergaard H. An experiment in partial evaluation: The generation of a compiler generator. In: Jouannoud J.-P. (Ed). Rewriting Techniques and Applications. Lecture Notes in Computer Science vol. 202 (1985)
24. Jones S.P. Haskell 98 Language and Libraries (2003), Cambridge University Press
25. In: Muchnick S.S., and Jones N.D. (Eds). Program Flow Analysis: Theory and Applications (1981), Prentice-Hall
26. A. Mycroft, N.D. Jones, A relational framework for abstract interpretation, in: [9], 1986, pp. 156-171
27. Reynolds J. Automatic computation of data set definitions. Information Processing 68 (1969) 456-461
28. Reynolds J. Definitional interpreters for higher-order programming languages. Proceedings of the ACM Annual Conference (1972), ACM Press 717-740
29. O. Shivers, Control-flow analysis of higher-order languages, Ph.D. Thesis, Carnegie-Mellon Univ., Pittsburgh, PA, USA, 1991
30. D. Stefanescu, Y. Zhou, An equational framework for the flow analysis of higher order functional programs, in: ACM Symposium on Lisp and Functional Programming, 1994, pp. 318-327
31. J. Thatcher, Tree automata: An informal survey, in: [3], 1973
32. Toyama Y. Termination of S-expression rewriting systems: Lexicographic path ordering for higher-order terms. Proceedings of the 15th International Conference on Rewriting Techniques and Applications RTA 2004. Lecture Notes in Computer Science vol. 3091 (2004) 40-54
33. V. Turchin, The language REFAL, the theory of compilation, and metasystem analysis, Technical report, Courant Institute Report, New York, 1980
34. P. Wadler, An introduction to Orwell, Technical report, Programming Research Group, Oxford University, 1985
35. P. Wadler, Strictness analysis on non-flat domains by abstract interpretation over finite domains, 1987, pp. 266-275 (Chapter 12)
36. H. Xi, Dependent types in practical programming, Ph.D. Thesis, Carnegie-Mellon Univ., Pittsburgh, PA, USA, 1998