A higher-order removal method

Higher-Order and Symbolic Computation

Volumn 9, Issue 4, 1996, Pages 287-322

  Chin, Wei Ngan ^a   Darlington, John ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Compiler Optimization; Eta Expansion; Function Specialisation; Higher Order Removal; Parameter Analysis; Program Transformation; Termination Proofs

Indexed keywords

EID: 0347729195     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf01806315     Document Type: Article

References (32)

1. E. Astesiano and G. Costa. Languages with reducing reflexive types. In Automata, Languages and Programming, (LNCS, vol 85, pp. 38-50) Berlin Heidelberg New York: Springer, 1980.
2. L. Augustsson and T. Johnsson. The Chalmers' Lazy ML compiler. The Computer Journal, 32(2):127-141, February 1989.
3. R.M. Burstall and J. Darlington. A transformation system for developing recursive programs. Journal of ACM, 24(l):44-67, January 1977.
4. D. Bjmer, A.P. Ershov, and N.D. Jones. Workshop on Partial Evaluation and Mixed Computations. Gl Avarnes, Denmark, North-Holland, 1988.
5. J. M. Bell and J. Hook. Defunctionalization of typed programs. Tech Report 94-025, Oregon Graduate Institute, February 1994.
6. G.L. Burn. Abstract Interpretation and Parallel Evaluation of Functional Languages. PhD thesis, Imperial College, University of London, 1987.
7. Wei-Ngan Chin. Automatic Methods for Program Transformation. PhD thesis, Imperial College, University of London, March 1990.
8. Wei-Ngan Chin. Fully lazy higher-order removal. In ACM Workshop on Partial Evaluation and SemanticsBased Program Manipulation, pages 38-47, San Francisco, California, June 1992.
9. Wei-Ngan Chin. Safe fusion of functional expressions. In 7th ACM LISP and Functional Programming Conference, pages 11-20, San Francisco, California, June 1992. ACM Press.
10. Wei-Ngan Chin. Synthesizing parallel lemma. In Proc of a JSPS Seminar on Parallel Programming Systems, World Scientific Publishing, pages 201-217, Tokyo, Japan, May 1992.
11. Wei-Ngan Chin. Safe fusion of functional expressions II: Further improvements. Journal of Functional Programming, 4(4):515-555, October 1994.
12. O. Danvy and A. Filinsky. Abstracting control. 6th ACM LISP and Functional Programming Conference, pages 151-160, June 1990.
13. Michael Georgeff. Transformation and reduction strategies for typed lambda expressions. ACM Trans, on Programming Languages and Systems, 6(4):603-631, October 1984.
14. Joseph Goguen. Higher-order functions considered unnecessary for higher-order programming. SRI-CSL 88-1, SRI International, January 1988.
15. P. Hudak and et al. Report on the programming language Haskell: A non-strict, purely functional language. ACM SIGPLAN Notices, 27(5), May 1992.
16. Garsten Kehler Holst. Finiteness analysis. In 5th ACM Functional Programming Languages and Computer Architecture Conference, Cambridge, Massachusetts, (LNCS, vol 523, pp. 473-495), August 1991.
17. John Hughes. Supercombinators: A new implementation method for applicative languages. 2nd ACM Symposium on LISP and Functional Programming, pages 1-10, 1982.
18. John Hughes. Why functional programming matters. The Computer Journal, 32(2):89-!07, 1989.
19. S.B. Jones and D.L. Metayer. Compile-time garbage collection by sharing analysis. In 4th ACM Conference on Functional Programming Languages and Computer Architecture, pages 54-74, London, September 1989. ACM Press.
20. Thomas Johnsson. Lambda lifting: Transforming programs to recursive equations. In 2nd ACM Functional Programming Languages and Computer Architecture Conference, Nancy, France, (LNCS, vol 201, pp. 190-203) Berlin Heidelberg New York: Springer, 1985.
21. N.D. Jones, P. Sestoft, and H. Sondergaard. An experiment in partial evaluation: the generation of a compiler generator. Journal of LISP and Symbolic Computation, 2(1):9-50, 1989.
22. Robin Milner. A theory of type polymorphism. / Computer and System Science, pages 348-375, 1978.
23. George C. Nelan. Firstification. PhD thesis, Arizona State University, December 1991.
24. H.R. Nielson and F. Nielson. Transformations on higher-order functions. In 4th ACM Functional Programming Languages and Computer Architecture Conference, pages 129-143, London, September 1989. ACM Press.
25. R.C. Reynolds. Definitional interpreters for higher-order programming. In ACM Annual Conference, pages 717-740, July 1972.
26. C. Runciman, M. Firth, and N. Jagger. Transformation in a non-strict language : An approach to instantiation. In Glasgow Functional Programming Workshop, August 1989.
27. David Sands. Total correctness by local improvement in program transformation. In ACM Principles of Programming Languages Conference, pages 221-232. ACM Press, January 1995.
28. Peter Thiemann. Type-based termination analysis for partial evaluation. In Submitted for Publication, April 1996.
29. C.P. Wadsworth. Semantics and Pragmatics of the Lambda Calculus. PhD thesis, Oxford University, 1977.
30. Phil Wadler. Deforestation: Transforming programs to eliminate trees. In European Symposium on Programming, Nancy, France, (LNCS, vol 300, pp. 344-358), March 1988.
31. PhilWadler. Theorems for free! ln4thACMFunctionalProgrammingLanguagesandComputer Architecture Conference, pages 347-359, London, September 1989. ACM Press.
32. Phil Wadler. The essence of functional programming. In ACM Principles of Programming Languages Conference. ACM Press, January 1992.