Synchronisation analysis to stop tupling

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

Volumn 1381, Issue , 1998, Pages 75-89

  Chin, Wei Ngan ^a   Khoo, Siau Cheng ^a   Lee, Tat Wee ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b Singapore Police Force   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR TRANSFORMATIONS;

LINEAR SPEED-UP; NON TERMINATIONS; OPTIMISATIONS; PARAMETER ANALYSIS; POLYNOMIAL COMPLEXITY; RECURSIONS; TERMINATION PROBLEMS; TUPLING;

MATHEMATICAL TRANSFORMATIONS;

EID: 84947748409     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053564     Document Type: Conference Paper

References (20)

1. E. Barendsen and J.E.W. Smetsers. Conventional and uniqueness typing in graph rewrite systems. In 13th Conference on the Foundations of Software Technology & Theoretical Computer Science, pages 45-51, Bombay, India, December 1993.
2. Wei-Ngan Chin. Towards an automated tupling strategy. In ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 119-132, Copenhagen, Denmark, June 1993. ACM Press.
3. Wei-Ngan Chin and Masami Hagiya. A bounds inference method for vector-based memoisation. In 2nd ACM SIGPLAN Intl. Conference on Functional Programming, pages 176-187, Amsterdam, Holland, June 1997. ACM Press.
4. W.N. Chin, S.C. Khoo, and T.W. Lee. Synchronisation analysis to stop tupling -extended abstract. Technical report, Dept of IS/CS, NUS, Dec 1997. http://www.iscs.nus.sg/'khoosc/paper/synTech.ps.gz.
5. W.N. Chin, S.C. Khoo, and P. Thiemann. Synchronisation analyses for multiple recursion parameters. In Inti Dagstuhl Seminar on Partial Evaluation (LNCS 1110), pages 33-53, Germany, February 1996.
6. Norman H. Cohen. Eliminating redundant recursive calls. ACM Trans, on Programming Languages and Systems, 5(3):265-299, July 1983.
7. Z. Hu, H. Iwasaki, M. Takeichi, and A. Takano. Tupling calculation eliminates multiple traversals. In 2nd ACM SIGPLAN International Conference on Functional Programming, pages 164-175, Amsterdam, Netherlands, June 1997. ACM Press.
8. N.D. Jones, C.K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993.
9. 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.
10. Tat Wee Lee. Synchronisation analysis for tupling. Master’s thesis, DISCS, National University of Singapore, 1997. http://www.iscs.nus.sg/'khoosc/paper/ltw_thesis.ps.gz.
11. Y A. Liu, S D. Stoller, and T. Teitelbaum. Discovering auxiliary information for incremental computation. In 23rd ACM Symposium Principles of Programming Languages, pages 157-170, St. Petersburg, Florida, January 1996. ACM Press.
12. Y A. Liu and T. Teitelbaum. Caching intermediate results for program improvement. In ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 190-201, La Jolla, California, June 1995. ACM Press.
13. Donald Michie. Memo functions and machine learning. Nature, 218:19-22, April 1968.
14. A. Pettorossi and M. Proietti. Program derivation via list introduction. In IFIP TC Working Conf. on Algorithmic Languages and Calculi, Le Bischenberg, France, February 1997. Chapman & Hall.
15. A. Pettorossi and A. Skowron. Higher order generalization in program derivation. In TAPSOFT 87, Pisa, Italy, (LNCS, vol 250, pp. 306-325), March 1987.
16. Alberto Pettorossi. A powerful strategy for deriving programs by transformation. In 3rd ACM LISP and Functional Programming Conference, pages 273-281. ACM Press, 1984.
17. M. Proietti and A. Pettorossi. Unfolding -definition -folding, in this order for avoiding unnecessary variables in logic programs. In Proceedings of PLILP, Passau, Germany, (LNCS, vol 528, pp. 347-258) Berlin Heidelberg New York: Springer, 1991.
18. H. Seidl and M.H. Sorensen. Constraints to stop higher-order deforestation. In 24th ACM Symposium on Principles of Programming Languages, Paris, France, January 1997. ACM Press.
19. Jan Sparud. How to avoid space-leak without a garbage collector. In ACM Conference on Functional Programming and Computer Architecture, pages 117-122, Copenhagen, Denmark, June 1993. ACM Press.
20. Phil Wadler. Deforestation: Transforming programs to eliminate trees. In European Symposium on Programming, Nancy, France, (LNCS, vol 300, pp. 344-358), March 1988.