Formal Derivation of Efficient Parallel Programs by Construction of List Homomorphisms

ACM Transactions on Programming Languages and Systems

Volumn 19, Issue 3, 1997, Pages 444-461

  Hu, Zhenjiang ^a   Iwasaki, Hideya ^b   Takechi, Masato ^a  

^a UNIVERSITY OF TOKYO   (Japan)

^b TOKYO UNIVERSITY OF AGRICULTURE AND TECHNOLOGY   (Japan)

Author keywords

D.1.1 Programming Techniques : Applicative (Functional) Programming; D.1.3 Programming Techniques : Concurrent Programming parallel programming; F.3.3 Logics and Meanings of Programs : Studies of Program Constructs program and recursion schemes

Indexed keywords

DATA STRUCTURES; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; RECURSIVE FUNCTIONS;

LIST HOMOMORPHISM; PARALLEL FUNCTIONAL PROGRAMMING;

PARALLEL PROCESSING SYSTEMS;

EID: 0031144375     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/256167.256201     Document Type: Article

References (24)

1. BARNARD, D., SCHMEISER, J., AND SKILLICORN, D. 1991. Deriving associative operators for language recognition. Bull. EATCS 43, 131-139.
2. BIRD, R. 1984. The promotion and accumulation strategies in transformational programming. ACM Trans. Program. Lang. Syst. 6, 4, 487-504.
3. BIRD, R. 1987. An introduction to the theory of lists. In Logic of Programming and Calculi of Discrete Design, M. BROY, Ed. Springer-Verlag, Berlin, 5-42.
4. CAI, W. AND SKILLICORN, D. 1992. Calculating recurrences using the Bird-Meertens Formalism. Tech. Rep., Dept. of Computing and Information Science, Queen's Univ., Kingston, Canada.
5. CHIN, W. 1992. Safe fusion of functional expressions. In Proceedings of the Conference on Lisp and Functional Programming. ACM Press, New York, 11-20.
6. CHIN, W. 1993. Towards an automated tupling strategy. In Proceedings of the Conference on Partial Evaluation and Program Manipulation. ACM Press, New York, 119-132.
7. CHIN, W. 1996. Parallelizing conditional recurrences. In the Annual European Conference on Parallel Processing. Lecture Notes in Computer Science, vol. 1123. Springer-Verlag, Berlin, 579-586.
8. COLE, M. 1993a. List homomorphic parallel algorithms for bracket matching. Tech. Rep. CSR-29-93, Dept. of Computing Science, The Univ. of Edinburgh, Edinburgh, Scotland.
9. COLE, M. 1993b. Parallel programming, list homomorphisms and the maximum segment sum problems. Tech. Rep. CSR-25-93, Dept. of Computing Science, The Univ. of Edinburgh, Edinburgh, Scotland.
10. FEATHER, M. 1987. A survey and classification of some program transformation techniques. In the TC2 IFIP Working Conference on Program Specification and Transformation. North Holland, Amsterdam, 165-195.
11. FOKKINGA, M. 1992. A gentle introduction to category theory - The calculational approach. Tech. Rep. Lecture Notes, Dept. INF, Univ. of Twente, Twente, The Netherlands.
12. GIBBONS, J. 1994. The third homomorphism theorem. Tech. Rep., Univ. of Auckland, Auckland, New Zealand.
13. GILL, A., LAUNCHBURY, J., AND JONES, S. P. 1993. A short cut to deforestation. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture. ACM Press, New York, 223-232.
14. GORLATCH, S. 1995. Constructing list homomorphisms. Tech. Rep. MIP-9512, Fakultät für Mathematik und Informatik, Universität Passau, Passau, Germany.
15. GORLATCH, S. 1996a. Systematic efficient parallelization of scan and other list homomorphisms. In the Annual European Conference on Parallel Processing. Lecture Notes in Computer Science, vol. 1124. Springer-Verlag, Berlin, 401-408.
16. GORLATCH, S. 1996b. Systematic extraction and implementation of divide-and-conquer parallelism. Microprocess. Microprogramm. 41, 571-578.
17. HU Z., IWASAKI, H., AND TAKEICHI, M. 1996a. Construction of list homomorphisms by tupling and fusion. In the 21st International Symposium on Mathematical Foundation of Computer Science. Lecture Notes in Computer Science, vol. 1113. Springer-Verlag, Berlin, 407-418.
18. HU, Z. IWASAKI, H. AND TAKEICHI, M. 1996b. Deriving structural hylomorphisms from recursive definitions. In the ACM SIGPLAN Intentional Conference on Functional Programming. ACM Press, New York, 73-82.
19. HU Z., IWASAKI, H., AND TAKEICHI, M. 1996c. Formal derivation of parallel program for 2-dimensional maximum segment sum problem. In the Annual European Conference on Parallel Processing. Lecture Notes in Computer Science, vol. 1123. Springer-Verlag, Berlin, 553-562.
20. MEIJER, E., FOKKINGA, M., AND PATERSON, R. 1991. Functional programming with bananas, lenses, envelopes and barbed wire. In Proceedings of the Conference on Functional Programming Languages and Computer Architecture. Lecture Notes in Computer Science, vol. 523. Springer-Verlag, Berlin, 124-144.
21. PETTOROSSI, A. AND PROIETTI, M. 1993. Rules and strategies for program transformation. In the IFIP TC2/WG2.1 State-of-the-Art Report. Lecture Notes in Computer Science, vol. 755. Springer-Verlag, Berlin, 263-303.
22. SMITH, D. 1987. Applications of a strategy for designing divide-and-conquer algorithms. Sci. Comput. Program. 9, 213-229.
23. TAKANO, A. AND MEIJER, E. 1995. Shortcut deforestation in calculational form. In the Proceedings of the Conference on Functional Programming Languages and Computer Architecture. ACM Press, New York, 306-313.
24. TAKEICHI, M. 1987. Partial parametrization eliminates multiple traversals of data structures. Acta Informatica 24, 57-77.