Constraints to stop deforestation

Science of Computer Programming

Volumn 32, Issue 1-3, 1998, Pages 73-107

  Seidl, H ^a   Sorensen M H ^b  

^a UNIVERSITY OF TRIER   (Germany)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Constraint based program analysis; Deforestation; Higher order functional programs; Integer constraints; Intermediate data structures; Termination detection

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATA STRUCTURES; PROGRAM COMPILERS;

CONSTRAINT-BASED PROGRAM ANALYSIS; HIGHER-ORDER FUNCTIONAL PROGRAMS; WADLER'S DEFORESTATION ALGORITHMS;

COMPUTER PROGRAMMING;

EID: 0032162523     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6423(97)00031-2     Document Type: Article

References (68)

1. Z.M. Ariola, M. Felleisen, M. Maraist, J. Odersky, P. Wadler, A call-by-need lambda-calculus, in: Conf. Record of the Ann. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, ACM Press, Washington, DC, 1995, pp. 233-246.
2. H.P. Barendregt, Lambda calculi with types, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, Vol. II, Oxford University Press, Oxford, 1992, pp. 117-309.
3. R. Bird, Using circular programs to eliminate multiple traversals of data, Acta Inform. 21 (1984) 239-250.
4. A. Bondorf, Self-applicable partial evaluation, Ph.D. Thesis, Department of Computer Science, University of Copenhagen, 1990; DIKU-Rapport 90/17.
5. A. Bondorf, Automatic autoprojection of recursive equations, Science of Computer Programming 17 (1-3) (1991) 3-34.
6. R.M. Burstall, J. Darlington, A transformation system for developing recursive programs, J. Assoc. Comput. Mach. 24 (1) (1977) 44-67.
7. W.-N. Chin, Automatic methods for program transformation, Ph.D. Thesis, Imperial College, University of London, 1990.
8. W.-N. Chin, Generalising deforestation to all first-order functional programs, in: Workshop on Static Analysis of Equational, Functional and Logic Programming Languages, BIGRE, Vol. 74, 1991, pp. 173-181.
9. W.-N. Chin, Fully lazy higher-order removal, in: Proc. ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation, 1992, pp. 38-47; Yale University Technical Report YALEU/DCS/RR-909.
10. W.-N. Chin, Safe fusion of functional expressions, in: ACM Conf. on Lisp and Functional Programming, ACM Press, Washington, DC, 1992, pp. 11-20.
11. W.-N. Chin, Safe fusion of functional expressions II: Further improvements, J. Funct. Programming 4 (4) (1994) 515-555.
12. W.-N. Chin, J. Darlington, Higher-order removal transformation technique for functional programs, in: Australian Computer Science Conf., Vol. 14,1 of Australian CS Comm., 1992, pp. 181-194.
13. W.-N. Chin, S.-C. Khoo, Better consumers for deforestation, in: D.S. Swierstra (Ed.), Programming Languages: Implementations, Logics and Programs, Lecture Notes in Computer Science, Vol. 982, Springer, Berlin, 1995, pp. 223-240.
14. J. Darlington, An experimental program transformation and synthesis system, Artificial Intelligence 16 (1981) 1-46.
15. M.S. Feather, A system for assisting program transformation, ACM Trans. Programming Languages Systems 4 (1) (1982) 1-20.
16. L. Fegaras, T. Sheard, T. Zhou, Improving programs which recurse over multiple inductive structures, in: Proc. ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation, 1994.
17. A. Ferguson, P.L. Wadler, When will deforestation stop? in: Glasgow Workshop on Functional Programming, 1988, pp. 39-56.
18. A.J. Gill, Cheap deforestation for non-strict functional languages, Ph.D. Thesis, Department of Computing Science, Glasgow University, 1996.
19. A.J. Gill, J. Launchbury, S.L. Peyton Jones, A short cut to deforestation, in: Conf. on Functional Programming and Computer Architecture, ACM Press, Washington, DC, 1993, pp. 223-232.
20. A.J. Gill, S.L. Peyton Jones, Cheap deforestation in practice: An optimiser for Haskell, in: IFIP, 1994, pp. 581-586.
21. G. Hamilton, Compile-time optimisations of storage usage in lazy functional programs, Ph.D. Thesis, University of Stirling, 1993.
22. G. Hamilton, Extending first order deforestation, Technical Report TR 95-06, Department of Computer Science, Keele University, 1995.
23. G. Hamilton, Higher order deforestation, Technical Report TR 95-07, Department of Computer Science, Keele University, 1995.
24. G. Hamilton, Higher order deforestation, in: H. Kuchen, S.D. Swierstra (Eds.), Programming Languages: Implementations, Logics and Programs, Lecture Notes in Computer Science, Vol. 1140, Springer, Berlin, 1996, pp. 213-227.
25. G. Hamilton, S.B. Jones, Extending deforestation for first order functional programs, in: Glasgow Workshop on Functional Programming, 1991, pp. 134-145.
26. G. Hamilton, S.B. Jones, Transforming programs to eliminate intermediate structures, in: Workshop on Static Analysis of Equational, Functional and Logic Programming Languages, BIGRE, Vol. 74, 1991, pp. 182-188.
27. N. Heintze, Set-based analysis of ML programs, in: ACM Conf. on Lisp and Functional Programming, 1994, pp. 306-317.
28. F. Henglein, Type inference with polymorphic recursion, ACM Trans. Programming Languages Systems 15 (2) (1993) 253-289.
29. J.R. Hindley, The principal type scheme of an object in combinatory logic, Trans. Amer. Math. Soc. 146 (1969) 29-60.
30. C.K. Holst, Finiteness analysis, in: J. Hughes (Ed.), Conf. on Functional Programming and Computer Architecture, Lecture Notes in Computer Science, Vol. 523, Springer, Berlin, 1991, pp. 495-519.
31. J. Hughes, Why functional programming matters, in: D. Turner (Ed.), Research Topics in Functional Programming, Addison-Wesley, Reading, MA, 1990.
32. R.B. Kierburtz, J. Schultis, Transformations of FP program schemes, in: Conf. on Functional Programming and Computer Architecture, ACM Press, Washington, DC, 1981, pp. 41-48.
33. J. Launchbury, T. Sheard, Warm fusion: Deriving build-catas from recursive definitions, in: Conf. on Functional Programming and Computer Architecture, ACM Press, Washington, DC, 1995, pp. 314-323.
34. M. Leuschel, B. Martens, Global control for partial deduction through characteristic atoms and global trees, in: O. Danvy, R. Glück, P. Thiemann (Eds.), Partial Evaluation, Lecture Notes in Computer Science, Vol. 1110, Springer, Berlin, 1996, pp. 263-283.
35. Z. Manna, R. Waldinger, Synthesis: Dreams ⇒ programs, IEEE Trans. Software Engrg. 5 (4) (1979) 157-164.
36. S. Marlow, P.L. Wadler, Deforestation for higher-order functions, in: J. Launchbury (Ed.), Glasgow Workshop on Functional Programming, Workshops in Computing, 1992, pp. 154-165.
37. S.D. Marlow, Deforestation for higher-order functional languages, Ph.D. Thesis, University of Glasgow, 1996.
38. R. Milner, A theory of type polymorphism in programming, J. Comput. System Sci. 17 (1978) 348-375.
39. A. Mycroft, Polymorphic type schemes and recursive definitions, in: Proc. 6th Internat. Conf. on Programming, Lecture Notes in Computer Science, Vol. 167, Springer, Berlin, 1984, pp. 217-228.
40. K. Nielsen, M.H. Sørensen, Call-by-name CPS-translation as a binding-time improvement, in: A. Mycroft (Ed.), Static Analysis Symp., Lecture Notes in Computer Science, Vol. 983, Springer, Berlin, 1995, pp. 296-313.
41. H.R. Nielson, F. Nielson, Infinitary control flow analysis: a collecting semantics for closure analysis, in: Conf. Record of the Ann. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, ACM Press, Washington, DC, 1997, pp. 332-345.
42. J. Palsberg, Closure analysis in constraint form, ACM Trans. Programming Languages Systems 17 (1995) 47-82.
43. J. Palsberg, P. O'Keefe, A type system equivalent to flow analysis, ACM Trans. Programming Languages Systems 17 (1995) 576-599.
44. D. Sands, Proving the correctness of recursion-based automatic program transformation, in: P. Mosses, M. Nielsen, M.I. Schwartzbach (Eds.), Theory and Practice of Software Development, Lecture Notes in Computer Science, Vol. 915, Springer, Berlin, 1995, pp. 681-695.
45. D. Sands, Total correctness by local improvement in program transformation, in: Conf. Record of the Ann. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, ACM Press, Washington, DC, 1995, pp. 221-232.
46. D. Sands, Proving the correctness of recursion-based automatic program transformations, Theoret. Comput. Sci. A 167 (1996).
47. D. Sands, Total correctness by local improvement in the transformation of functional programs, ACM Trans. Programming Languages Systems 18 (2) (1996).
48. W.L. Scherlis, Program inprovement by internal specialization, in: Conf. Record of the Ann. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, ACM Press, Washington, DC, 1981, pp. 41-49.
49. H. Seidl, Least solutions of equations over N in: Internat. Coll. on Automata, Languages, and Programming, Lecture Notes in Computer Science, Vol. 820, 1994, pp. 400-411.
50. H. Seidl, Integer constraints to stop deforestation, in: European Symp. on Programming, Lecture Notes in Computer Science, Vol. 1058, Springer, Berlin, 1996, pp. 326-340.
51. H. Seidl, Least and greatest solutions of equations over script N sign, Nordic J. Comput. 3 (1996) 41-62.
52. H. Seidl, M.H. Sørensen, Constraints to stop higher-order deforestation, in: Conf. Record of the Ann. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, ACM Press, Washington, DC, 1997, pp. 400-413.
53. P. Sestoft, Automatic call unfolding in a partial evaluator, in: D. Bjørner, A.P. Ershov, N.D. Jones (Eds.), Partial Evaluation and Mixed Computation, North-Holland, Amsterdam, 1988, pp. 485-506.
54. P. Sestoft, Replacing function parameters by global variables, in: Conf. on Functional Programming and Computer Architecture, ACM Press, Washington, DC, and Addison-Wesley, Reading, MA, 1989, pp. 29-53.
55. T. Sheard, L. Fegaras, A fold for all seasons, in: Conf. on Functional Programming and Computer Architecture, ACM Press, Washington, DC, 1993, pp. 233-242.
56. T. Sheard, L. Fegaras, Optimizing algebraic programs, Technical Report 94-004, Oregon Graduate Institute, 1994.
57. O. Shivers, Control-flow analysis in scheme, in: Programming Languages: Design and Implementation, 1988, pp. 114-128.
58. O. Shivers, Control-flow analysis of higher-order languages, Ph.D. Thesis, Carnegie Mellon University, 1991.
59. M.H. Sørensen, A grammar-based data-flow analysis to stop deforestation, in: S. Tison (Ed.), Coll. on Trees in Algebra and Programming, Lecture Notes in Computer Science, Vol. 787, Springer, Berlin, 1994, 335-351.
60. M.H. Sørensen, R. Glück, An algorithm of generalization in positive supercompilation, in: J.W. Lloyd (Ed.), Logic Programming: Proceedings of the 1995 Internat. Symp., MIT Press, Cambridge, MA, 1995, pp. 465-479.
61. A. Takano, E. Meijer, Shortcut deforestation in calculational form, in: Conf. on Functional Programming and Computer Architecture, ACM Press, Washington, DC, 1995, pp. 306-313.
62. V.F. Turchin, R. Nirenberg, D. Turchin, Experiments with a supercompiler, in: ACM Conf. on Lisp and Functional Programming, ACM Press, Washington, DC, 1982, pp. 47-55.
63. P.L. Wadler, Applicative style programming, program transformation, and list operators, in: Conf. on Functional Programming and Computer Architecture, ACM Press, Washington, DC, 1981, pp. 25-32.
64. P.L. Wadler, Listlessness is better than laziness, in: ACM Conf. on Lisp and Functional Programming, ACM Press, Washington, DC, 1984, pp. 282-305.
65. P.L. Wadler, Listlessness is better than lazyness II: Composing listless functions, in: Workshop on Programs as Data Objects, Lecture Notes in Computer Science, Vol. 217, Springer, Berlin, 1985.
66. P.L. Wadler, Deforestation: transforming programs to eliminate trees, in: European Symp. on Programming, Lecture Notes in Computer Science, Vol. 300, Springer, Berlin, 1988.
67. P.L. Wadler, Theorems for free!, in: Conf. on Functional Programming and Computer Architecture, ACM Press, Washington, DC, 1989.
68. P.L. Wadler, Deforestation: transforming programs to eliminate intermediate trees, Theoret. Comput. Sci. 73 (1990) 231-248.