The third homomorphism theorem on trees downward & upward lead to divide-and-conquer

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2009, Pages 177-185

  Morihata, Akimasa ^a   Matsuzaki, Kiminori ^a   Hu, Zhenjiang ^b   Takeichi, Masato ^a  

^a UNIVERSITY OF TOKYO   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

Divide and conquer; Huet's zippers; Polynomial data structures; The third homomorphism theorem

Indexed keywords

ASSOCIATIVITY; AUTOMATIC PARALLELIZATION; DIVIDE-AND-CONQUER; HUET'S ZIPPERS; PARALLEL PROGRAM; SEQUENTIAL PROGRAMS; SUBTREES; THE THIRD HOMOMORPHISM THEOREM;

DATA STRUCTURES; FASTENERS; PARALLEL ARCHITECTURES; PARALLEL PROGRAMMING; POLYNOMIALS;

THEOREM PROVING;

EID: 67649851010     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1480881.1480905     Document Type: Conference Paper

References (26)

1. Karl R. Abrahamson, N. Dadoun, David G. Kirkpatrick, and Teresa M. Przytycka. A simple parallel tree contraction algorithm. Journal of Algorithms, 10(2):287-302, 1989.
2. Roland Carl Backhouse, Patrik Jansson, Johan Jeuring, and Lambert G. L. T. Meertens. Generic programming: An introduction. In Advanced Functional Programming, pages 28-115, 1998.
3. Richard S. Bird. An introduction to the theory of lists. In Logic of Programming and Calculi of Discrete Design, pages 3-42. Springer, 1987. NATO ASI Series F Volume36.
4. Wei-Ngan Chin. Towards an automated tupling strategy. In Proceedings of the ACM SIGPLAN symposium on Partial evaluation and semanticsbased program manipulation, PEPM'93, pages 119-132, 1993.
5. Murray Cole. Parallel programming, list homomorphisms and the maximum segment sum problem. In Parallel Computing: Trends and Applications, PARCO 1993, Grenoble, France, pages 489-492. Elsevier, 1994.
6. Murray Cole. Parallel programming with list homomorphisms. Parallel Processing Letters, 5:191-203, 1995.
7. Richard Cole and Uzi Vishkin. The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time. Algorithmica, 3:329-346, 1988. (Pubitemid 18620772)
8. Maarten M. Fokkinga. Tupling and mutumorphisms. In Squiggolist, volume 1(4), 1989.
9. Ian Foster. Designing and Building Parallel Programs. Addison Wesley, 1995.
10. Alfons Geser and Sergei Gorlatch. Parallelizing functional programs by generalization. Journal of Functional Programming, 9(6):649-673, 1999. (Pubitemid 127118719)
11. Alan Gibbons andWojciech Rytter. Optimal parallel algorithm for dynamic expression evaluation and context-free recognition. Information and Computation, 81(1):32-45, 1989.
12. Jeremy Gibbons. The third homomorphism theorem. Journal of Functional Programming, 6(4):657-665, 1996. (Pubitemid 126491266)
13. Jeremy Gibbons, Wentong Cai, and David B. Skillicorn. Efficient parallel algorithms for tree accumulations. Science of Computer Programming, 23(1):1-18, 1994.
14. Zhenjiang Hu, Hideya Iwasaki, and Masato Takeichi. Formal derivation of efficient parallel programs by construction of list homomorphisms. ACM Transactions on Programming Languages and Systems, 19(3):444-461, 1997a. (Pubitemid 127448490)
15. Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi, and Akihiko Takano. Tupling calculation eliminates multiple data traversals. In Proceedings of the 2nd ACM SIGPLAN International Conference on Functional Programming, ICFP'97, Amsterdam, The Netherlands, pages 164-175. 1997b. (Pubitemid 127455577)
16. Gérard P. Huet. The zipper. Journal of Functional Programming, 7(5): 549-554, 1997.
17. Kiminori Matsuzaki. Parallel Programming with Tree Skeletons. PhD thesis, Graduate School of Information Science and Technology, The University of Tokyo, 2007.
18. Kiminori Matsuzaki and Zhenjiang Hu. Implementation of tree skeletons on distributed-memory parallel computers. Technical Report METR 2006-65, Department of Mathematical Informatics, University of Tokyo, December 2006.
19. Kiminori Matsuzaki, Zhenjiang Hu, and Masato Takeichi. Parallelization with tree skeletons. In Euro-Par 2003. Parallel Processing, 9th International Euro-Par Conference, Klagenfurt, Austria, August 26-29, 2003. Proceedings, volume 2790 of Lecture Notes in Computer Science, pages 789-798. Springer, 2003. (Pubitemid 37223914)
20. Conor McBride. The derivative of a regular type is its type of one-hole contexts. Unpublished manuscript, 2001.
21. Gary L. Miller and John H. Reif. Parallel tree contraction and its application. In 26th Annual Symposium on Foundations of Computer Science, 21-23 October 1985, Portland, Oregon, USA, pages 478-489. 1985. (Pubitemid 16541447)
22. Akimasa Morihata and Kiminori Matsuzaki. A tree contraction algorithm on non-binary trees. Technical Report METR 2008-27, Department of Mathematical Informatics, University of Tokyo, 2008.
23. Kazutaka Morita, Akimasa Morihata, Kiminori Matsuzaki, Zhenjiang Hu, and Masato Takeichi. Automatic inversion generates divide-and-conquer parallel programs. In Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, San Diego, California, USA, June 10-13, 2007, pages 146-155, 2007. (Pubitemid 47630683)
24. Simon Peyton Jones, editor. Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, 2003.
25. John H. Reif, editor. Synthesis of Parallel Algorithms. Morgan Kaufmann Publishers, 1993.
26. David B. Skillicorn. Parallel implementation of tree skeletons. Journal of Parallel and Distributied Computing, 39(2):115-125, 1996. (Pubitemid 126167224)