Swapping arguments and results of recursive functions

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

Volumn 4014 LNCS, Issue , 2006, Pages 379-396

  Morihata, Akimasa ^a   Kakehi, Kazuhiko ^a   Hu, Zhenjiang ^a   Takeichi, Masato ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; COMPUTER SCIENCE; DATA STRUCTURES; INFORMATION TECHNOLOGY; RESPONSE TIME (COMPUTER SYSTEMS);

PALINDROMES; SWAPPING ARGUMENTS; SYSTEMATIC DERIVATIONS; WELL-STRUCTURED FUNCTIONS;

RECURSIVE FUNCTIONS;

EID: 33746074095     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11783596_22     Document Type: Conference Paper

References (25)

1. Bird, R., de Moor, O.: Algebra of Programming. Prentice Hall Int. Series in Computer Science. Prentice Hall (1996)
2. Bird, R.: Algebraic identities for program calculation. Computer J. 32(2) (1989) 122-126
3. Meijer, E., Fokkinga, M., Paterson, R.: Functional programming with bananas, lenses, envelopes and barbed wire. In Hughes, J., ed.: Proc. of 5th ACM Conf. on Functional Programming Languages and Computer Architecture, FPCA '91. Vol. 523 of Lect. Notes in Comput. Sci. Springer-Verlag (1991) 124-144
4. Bird, R.: Using circular programs to eliminate multiple traversals of data. Acta Inform. 21 (1984) 239-250
5. Chin, W.N.: Towards an automated tupling strategy. In Proc. of 1993 ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Baaed Program Manipulation, PEPM '93. ACM Press (1993) 119-132
6. Pettorossi, A., Proietti, M.: Rules and strategies for transforming functional and logic programs. ACM Comput. Surveys 28(2) (1996) 360-414
7. Hu, Z., Iwasaki, H., Takeichi, M., Takano, A.; Tupling calculation eliminates multiple data traversals, In Proc. of 2nd ACM SIGPLAN Int. Conf. on Functional Programming, ICFP '97. ACM Press (1997) 164-175
8. Bird, R.: Introduction to Functional Programming using Haskell. Prentice Hall Int. Series in Computer Science. Prentice Hall (1998)
9. Hu, Z., Iwasaki, H., Takeichi, M.: Deriving structural hylomorphisms from recursive definitions. In Proc. of 1st ACM SIGPLAN Int. Conf. on Functional Programming, ICFP '96. ACM Press (1996) 73-82
10. Morihata, A.: Relationship between arguments and results of recursive functions. Master's thesis. University of Tokyo (2006)
11. Chin, W.N.: Fully lazy higher-order removal. In Proc. of 1992 ACM SIGPLAN Wksh. on Partial Evaluation and Semantics-Based Program Manipulation, PEPM '92. TR YALEU/DCS/RR-909. Yale University (1992) 38-47
12. Danvy, O., Goldberg, M.: There and back again. In: Proc. of 7th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP'02. ACM Press (2002) 230-234
13. Morihata, A., Kakehi, K., Hu, Z., Takeichi, M.: IO swapping leads you there and back again. In Rutherford, M.J., ed.: Proc. of 7th GPCE Young Researchers Wksh., GPCE-YRW '05. Inst. of Cybernetics, Tallinn (2005) 7-13 Extended abstract of [14].
14. Morihata, A., Kakehi, K., Hu, Z., Takeichi, M.: Reversing iterations: IO swapping leads you there and back again. Techn. Report METR 2005-11, Dept. of Mathematical Informatics, University of Tokyo. (2005)
15. Reynolds, J.C.: Definitional interpreters for higher-order programming languages. Higher-Order and Symb. Comput. 11(4) (1998) 363-397
16. // Reprinted from Proc. of 25th ACM Nat. Conf. (1972), with a foreword.
17. Danvy, O., Goldberg, M.: There and back again. Fund. Inform. 66(4) (2005) 397-413
18. Nishimura, S.: Fusion with stacks and accumulating parameters. In Proc. of 2004 ACM SIGPLAN Wksh. on Partial Evaluation and Semantics-Based Program Manipulation, PEPM '04, ACM Press (2004) 101-112
19. Ganzinger, H., Giegerich, R.: Attribute coupled grammars. In Proc. of 1984 SIGPLAN Symp. on Compiler Construction. ACM Press (1984) 157-170
20. Knuth, D.E.: Semantics of context-free languages. Math. Syst. Theory 2(2) (1968) 127-145
21. Kühnemann, A.: Benefits of tree transducers for optimizing functional programs. In Arvind, V., Ramanujam, R., eds.: Proc. of 18th Conf. on Foundations of Software Technology & Theoretical Computer Science, FSTTCS'98. Vol. 1530 of Lect. Notes in Comput, SCi. Springer-Verlag (1998) 146-157
22. Kühnemann, A.: Comparison of deforestation techniques for functional programs and for tree transducers. In Middeldorp, A., Sato, T., eds.: Proc. of 4th Fuji Int. Symp. on Functional and Logic Programming, FLOPS '99. Vol. 1722 of Lect. Notes in Comput. Sci. Springer-Verlag (1999) 114-130
23. Correnson, L., Duris, E., Parigot, D., Roussel, G.: Declarative program transformation: A deforestation case-study. In Nadathur, G., ed.: Proc. of 1st Int. Conf. on Principles and Practice of Declarative Programming, PPDP '99. Vol. 1702 of Lect. Notes in Comput. Sci. Springer-Verlag (1999) 360-377
24. Voigtländer, J.: Using circular programs to deforest in accumulating parameters. Higher-Order and Symb. Comput. 17(1-2) (2004) 129-163
25. Boiten, E.A.: Improving recursive functions by inverting the order of evaluation. Sci. of Comput. Programming 18(2) (1992) 139-179