Synchronization analyses for multiple recursion parameters

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1110, Issue , 1996, Pages 33-53

  Chin, Wei Ngan ^a   Khoo, Siau Cheng ^a   Thiemann, Peter ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AUTOMATIC METHOD; NEW FUNCTIONS; OPTIMISATIONS; PARAMETER ANALYSIS; RECURSIONS; TUPLING;

FUNCTION EVALUATION;

EID: 33644621534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61580-6_3     Document Type: Conference Paper

References (15)

1. Lennart Augustsson Compiling pattern-matching. In 2nd ACM Functional Programming Languages and Computer Architecture Conference, Nancy, France, (Lect. Notes Comput. Sc., vol 201, pp. 368-381) Berlin Heidelberg New York: Springer, 1985
2. R.M. Burstall and J. Darlington. A transformation system for developing recursive programs. Journal of ACM, 24(1):44-67, January 1977
3. Richard S. Bird. Tabulation techniques for recursive programs. ACM Computing Surveys, 12(4):403-417, December 1980
4. Wei-Ngan Chin. Automatic Methods for Program Transformation. PhD thesis, Imperial College, University of London, March 1990
5. Wei-Ngan Chin. Towards an automated tupling strategy. In 3rd ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM Press, pages 119-132, Copenhagen, Denmark, ACM Press, June 1993
6. Wei-Ngan Chin. Tupling: an automatic compile-time memoisation transformation. Technical report, Dept of IS/CS, NUS, May 1995
7. Wei-Ngan Chin and Siau-Cheng Khoo. Tupling functions with multiple recursion parameters. In 3rd International Workshop on Static Analysis, Padova, Italy, (Lect. Notes Comput. Sc., vol 724, pp. 124-140) Berlin Heidelberg New York: Springer, 1993
8. Norman H Cohen Eliminating redundant recursive calls. ACM Trans. on Programming Languages and Systems, 5(3):265-299, July 1983
9. Carsten Kehler Ho1st Finiteness analysis In 5th ACM Functional Programming Languages and Computer Architecture Conference, pages 473-495, Cambridge, Massachusetts, August 1991
10. Donald Michie Memo functions and machine learning Nature, 218:19-22, 1968
11. Alberto Pettorossi A powerful strategy for deriving programs by transformation. In 3rd ACM LISP and Functional Programming Conference, pages 273-281, 1984.
12. N Pippenger Pebbling Rc 8258 (# 35937), IBM Thomas J Watson Research Centre, May 1980
13. M Proietti and A. Pettorossi. Unfolding - definition - folding, in this order for avoiding unnecessary variables in logic programs. In Proceedings of PLILP, Passau, Germany, (Lect. Notes Comput. Sc., vol 528, pp. 347-258) Berlin Heidelberg New York: Springer, 1991
14. [RFJ89] C. Runciman, M. Firth, and N. Jagger. Transformation in a non-strict language: An approach to instantiation. In Glasgow Functional Programming Workshop, August 1989
15. Phil Wadler Deforestation Transforming programs to eliminate trees. In European Symposium on Programming, pages 344-358, Nancy, France, March 1988.