Calculating accumulations

New Generation Computing

Volumn 17, Issue 2, 1999, Pages 153-173

  Hu, Zhenjiang ^a   Iwasaki, Hideya ^a   Takeichi, Masato ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA REDUCTION; DATA STRUCTURES; MATHEMATICAL TRANSFORMATIONS;

CONSTRUCTIVE ALGORITHMICS; FUNCTIONAL PROGRAMMING; PROGRAM CALCULATION; PROMOTION TRANSFORMATIONS;

PROGRAMMING THEORY;

EID: 0032613860     PISSN: 02883635     EISSN: None     Source Type: Trade Journal    
DOI: 10.1007/BF03037434     Document Type: Article

References (28)

1. Bird, R., "Tabulation techniques for recursive programs," ACM Computing Surveys, 12, 4, pp. 403-417, 1980.
2. Bird, R., "The promotion and accumulation strategies in transformational programming," ACM Transactions on Programming Languages and Systems, 6, 4, pp. 487-504, 1984.
3. Bird, R., "An introduction to the theory of lists," in Logic of Programming and Calculi of Discrete Design (M. Broy, ed.), Springer-Verlag, pp. 5-42, 1987.
4. Bird, R. and de Moor, O., Algebras of Programming, Prentice Hall, 1996.
5. Burstall, R. and Darlington, J., "A transformation system for developing recursive programs," Journal of the ACM, 24, 1, pp. 44-67, Jan. 1977.
6. Feather, M., "A survey and classification of some program transformation techniques," in TC2 IFIP Working Conference on Program Specification and Transformation (Bad Tolz, Germany), North Holland, pp. 165-195, 1987.
7. Fokkinga, M., "A gentle introduction to category theory - the calculational approach -," Tech. Rep. Lecture Notes, Dept. INF, University of Twente, The Netherlands, Sept. 1992.
8. Fokkinga, M., "Law and Order in Algorithmics," Ph.D thesis, Dept. INF, University of Twente, The Netherlands, 1992.
9. Fokkinga, M., Jeuring, J., Meertens, L. and Meijer, E., "A translation from attribute grammars to catamorphisms," Squiggolist, pp. 1-6, Nov. 1990.
10. Gibbons, J., "Upwards and downwards accumulations on trees," in Mathematics of Program Construction, LNCS 669, Springer-Verlag, pp. 122-138, 1992.
11. Gill, A., Launchbury, J. and Jones, S. P., "A short cut to deforestation," in Proc. Conference on Functional Programming Languages and Computer Architecture, Copenhagen, Jun. 1993, pp. 223-232.
12. Hagino, T., "Category Theoretic Approach to Data Types," Ph.D thesis, University of Edinburgh, 1987.
13. Henderson, P., Functional Programming : Application and Implementation, Prentice Hall International, 1980.
14. Hu, Z., Iwasaki, H. and Takeichi, M., "Promotion strategies for parallelizing tree algorithms," in 11st Conf. Proc. Jpn Soc. for Software Sci. and Technical (JSSST '94), Osaka, Japan, Nov. 1994, pp. 421-424.
15. Hu, Z., Iwasaki, H. and Takeichi, M., "Deriving structural hylomorphisms from recursive definitions," in ACM SIGPLAN International Conference on Functional Programming, Philadelphia, PA, May 1996, ACM Press, pp. 73-82.
16. Hu, Z., Iwasaki, H., Takeichi, M. and Takano, A., "Tupling calculation eliminates multiple data traversals," in ACM SIGPLAN International Conference on Functional Programming, Amsterdam, The Netherlands, Jun. 1997, ACM Press, pp. 164-175.
17. Hu, Z., Takeichi, M. and Chin, W., "Parallelization in calculational forms," in 25th ACM Symposium on Principles of Programming Languages, San Diego, California, USA, Jan. 1998, pp. 316-328.
18. Hughes, R. J. M., "A novel representation of lists and its application to the function reverse," Information Processing Letters, 22, 3, pp. 141-144, Mar. 1986.
19. Jeuring, J., "Theories for Algorithm Calculation," Ph.D thesis, Faculty of Science, Utrecht University, 1993.
20. Malcolm, G., "Data structures and program transformation," Science of Computer Programming, 14, pp. 255-279, Aug. 1990.
21. Meijer, E., "Calculating Compilers," Ph.D thesis, University of Nijmegen, Toernooiveld, Nijmegen, The Netherlands, 1992.
22. Meijer, E., Fokkinga, M. and Paterson, R., "Functional programming with bananas, lenses, envelopes and barbed wire," in Proc. Conference on Functional Programming Languages and Computer Architecture, Cambridge, Massachuetts, Aug. 1991, LNCS 523, pp. 124-144.
23. Michie, D., "Memo functions and machine learning," Nature 218, pp. 19-22, 1968.
24. Pettorossi, A. and Proietti, M., "Rules and strategies for program transformation," in IFIP TC2/WG2.1 State-of-the-Art Report, LNCS 755, pp. 263-303, 1993.
25. Pettorossi, A. and Skowron, A., "Higher-order generalization in program derivation," in Conf. on Theory and Practice of Software Development, Pisa, Italy, 1987, LNCS 250, Springer Verlag, pp. 182-196.
26. Sheard, T. and Fegaras, L., "A fold for all seasons," in Proc. Conference on Functional Programming Languages and Computer Architecture, Copenhagen, Jun. 1993, pp. 233-242.
27. Takano, A. and Meijer, E., "Shortcut deforestation in calculational form," in Proc. Conference on Functional Programming Languages and Computer Architecture, La Jolla, California, Jun. 1995, pp. 306-313.
28. Yamashita, N., "Build-in Memoisation Mechanism for Functional Programs," Master thesis, Dept. of Information Engineering, University of Tokyo, 1995.