A new termination approach for specialization

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

Volumn 1924, Issue , 2000, Pages 72-91

  Song, Litong ^a   Futamura, Yoshihiko ^a  

^a WASEDA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC PROGRAMMING; EMBEDDINGS; SEMANTICS;

HOMEOMORPHIC EMBEDDING; PROGRAM SPECIALIZATION; RESIDUAL PROGRAMS; SEMANTIC INFORMATION; TRADITIONAL APPROACHES; TRANSFORMATION TECHNIQUES; WELL QUASI ORDERINGS;

APPLICATION PROGRAMS;

EID: 84957809211     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45350-4_8     Document Type: Conference Paper

References (27)

1. Andersen L.O. Program analysis and specialization for the C programming language, Ph.D. thesis, DIKU, University of Copenhagen (1994).
2. Bondorf A., Danvy O. Automatic autoprojection of recursive equations with global variables and abstract data types, Science of Computer Programming, Vol. 16, pp 151-195 (1991).
3. Bruynooghe M., De Schreye D., Martens B. A general criterion for avoiding infinite unfolding during partial deduction. New Generation Computing, 11(1): pp47-79 (1992).
4. Consel C. et al. A uniform approach for compile-time and run-time specialization. In: Danvy O., Glück R., Thiemann P. (eds.), Partial Evaluation. Proceedings. LNCS, Vol. 1110, pp54-72, Springer-Verlag (1996).
5. Dershowitz N. Termination of rewriting. Journal of Symbolic Computation, 3:69-116 (1987).
6. Futamura Y., Nogi K., Takano A., Essence of generalized partial computation. Theoretical Computer Science 90, pp61-79 (1991).
7. Futamura Y., Konishi Z, Implementation of experimental system for automatic program transformation based on generalized partial computation, to appear in Computer Software.
8. Futamura Y., Song L., Konishi Z. Control structures and termination conditions for generalized partial computation (GPC), The 15th National Conference of Computer Software Society of Japan, D5-1, pp313~316, 9, (1998)
9. Glück R., Sørensen M. H. A roadmap to supercompilation. In Danvy O., Glück R., Thiemann P., editors. Proceedings of the 1996 Dagstuhl Seminar on Partial Evaluation, LNCS 1110, pp137-160, Springer-Verlag (1996).
10. Higman G. Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society, 2: pp326-336 (1952).
11. Kenneth Kunen. Handbook of mathematical logic. pp371-401, Editted by Jon Brawise, North-Holland.
12. Knuth D. E., Morris J. H., Pratt V. R. Fast pattern matching in strings. SIAM Journal on Computing, 6(2): pp323-350 (1977).
13. Kruskal J. B. Well-quasi ordering, the tree theorem, and Vazsonyi’s conjecture. Transactions of the American Mathematical Society, 95: pp210-225 (1960).
14. Leuschel M. On the power of homeomorphic embedding for online termination, SAS’98, pp230-245 (1998).
15. Leuschel M., Martens B., De Schreye D. Controlling generalization and polyvariance in partial deduction of normal logic programs, TOPLAS, 20(1), pp209-258 (1998).
16. McCarthy J. Recursive functions of symbolic expressions and their computation by machine. Communications of the ACM 3(4): 184-195 (1960).
17. Martens B., De Schreye D. Automatic finite unfolding using well-founded measures. The Journal of Logic Programming, 28(2): pp89-146 (1996).
18. Meyer U. Techniques for partial evalutaion of imperative languages, PEPM’91, pp94-105 (1991).
19. Middeldorp A., Zantema H. Simple termination of rewrite systems. Theoretical Computer Science, 175(1): pp127-158 (1997).
20. Nash-Williams, C. St. J. A. On well-quasi-ordering finite trees, Proc. Cambridge Philos. Soc. 59(4) pp833-835 (1963).
21. Ruf E. Topics in online partial evaluation. Ph.D thesis, Standford University (1993).
22. Sahlin D. Mixtus: An automatic partial evaluator for full Prolog. New Generation Computing, 12(1): pp7-51 (1993).
23. Song L., Futamura Y. A termination function of recursive programs and its application to partial evaluation, The 56th National Conference of Information Processing Society of Japan, 3E-4, pp 312-313, 3, 1998.
24. Sørensen M. H., Glück R. An algorithm of generalization in positive super-compilation. In J.W.Lloyd, editor, Proceedings ILOS’95, pp465-479, Portland, USA (1995).
25. Sørensen M. H., Glück R., Jones N. D. A positive supercompiler. In: Journal of Functional Programming, 6(6): pp 811-838 (1996).
26. Turchin V. F. The concept of a supercompiler. TOPLAS, 8(3): pp292-325 (1986).
27. Weise D., Conybeare R., Ruf E., Seligman S. Automatic online partial evaluation. In Proceeding of the Conference on Functional Programming Languages and Computer Architectures, LNCS 523, pp165-191, Harvard University, Springer-Verlag (1991).