Parallelizing functional programs by generalization

Journal of Functional Programming

Volumn 9, Issue 6, 1999, Pages 649-673

  Geser, Alfons ^a   Gorlatch, Sergei ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033275394     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796899003536     Document Type: Article

References (33)

1. 3L: A structured high level programming language and its structured support. Concurrency: Practice & Exper., 7(3), 225-255.
2. Bachmair, L. (1989) Canonical Equational Proofs: Research Notes in Theoretical Computer Science, John Wiley & Sons.
3. Barnard, D., Schmeiser, J. and Skillicorn, D. (1991) Deriving associative operators for language recognition. Bulletin of EATCS, 43, 131-139.
4. Bentley, J. (1984) Programming pearls. Commun. ACM, 27, 865-871.
5. Bird, R. S. (1988) Lectures on constructive functional programming. In: M. Broy, editor, Constructive Methods in Computing Science: NATO ASI Series F: Computer and Systems Sciences 55, pp. 151-216. Springer-Verlag.
6. Blelloch, G. (1989) Scans as primitive parallel operations. IEEE Trans. Computers, 38(11), 1526-1538.
7. Blelloch, G. (1993) NESL: a nested data-parallel language (Version 2.6). Technical Report CMU-CS-93-129, School of Computer Science, Carnegie Mellon University.
8. Cole, M. (1988) Algorithmic skeletons: A structured approach to the management of parallel computation. Ph.D. Thesis. Technical Report CST-56-88, Department of Computer Science, University of Edinburgh.
9. M. Cole. Parallel programming with list homomorphisms. Parallel Process. Lett., 5(2), 191-204.
10. Comon, H., Haberstrau, M. and Jouannaud, J.-P. (1994) Syntacticness, cycle-syntacticness, and shallow theories. Infor. & Computation, 111, 154-191.
11. Darlington, J., Guo, Y., To, H. W. and Jing, Y. (1995) Skeletons for structured parallel composition. Proc. 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming.
12. Fraus, U. and Hußmann, H. (1992) Term induction proofs by a generalization of narrowing. In: C. Rattray and R. G. Clark, editors, The Unified Computation Laboratory - Unifying Frameworks, Theories and Tools. Clarendon Press.
13. Geser, A. (1995) Mechanized inductive proof of properties of a simple code optimizer. In: P. D. Mosses, M. Nielsen and M. I. Schwartzbach, editors, Proc. 6th Theory and Practice in Software Development (TAPSOFT): Lecture Notes in Computer Science 915, pp. 605-619. Springer-Verlag.
14. Gibbons, J. (1996) The third homomorphism theorem. J. Functional Programming, 6(4), 657-665.
15. Gorlatch, S. (1995) Constructing list homomorphisms. Technical Report MIP-9512, Universität Passau, Germany.
16. Gorlatch, S. (1996a) Systematic efficient parallelization of scan and other list homomorphisms. In: L. Bouge, P. Fraigniaud, A. Mignotte and Y. Robert, editors, Euro-Par'96. Parallel Processing: Lecture Notes in Computer Science 1124, pp. 401-408. Springer-Verlag.
17. Gorlatch, S. (1996b) Systematic extraction and implementation of divide-and-conquer parallelism. In: H. Kuchen and D. Swierstra, editors, Programming languages: Implementation, Logics and Programs: Lecture Notes in Computer Science 1140, pp. 274-288. Springer-Verlag.
18. Gorlatch, S. and Bischof, H. (1997) Formal derivation of divide-and-conquer programs: A case study in the multidimensional FFT's. In: D. Mery, editor, Formal Methods for Parallel Programming: Theory and Applications. Workshop at IPPS'97, pp. 80-94.
19. Heinz, B. (1994) Lemma discovery by anti-unification of regular sorts. Technical Report 94-21, TU Berlin, Germany.
20. Hudak, P. (1991) Para-functional Programming in Haskell, pp. 159-196. ACM Press.
21. Huet, G. (1980) Confluent reductions: abstract properties and applications to term rewriting systems. J. ACM, 27(4), 797-821.
22. Jouannaud, J.-P. (1990) Syntactic theories. In: B. Rovan, editor, Mathematical Foundations of Computer Science: Lecture Notes in Computer Science 452, pp. 15-25. Banská Bystrica. Springer-Verlag.
23. Klop, J. W. (1992) Term rewriting systems. In: S. Abramsky, D. M. Gabbay and T. Maibaum, editors, Handbook of Logic in Computer Science, Vol. I, Chap. 6, pp. 1-116. Clarendon Press.
24. Lange, S. (1989) Towards a set of inference rules for solving divergence in Knuth-Bendix completion. In: K. P. Jantke, editor, Proc. Analogical and Inductive Inference: Lecture Notes in Computer Science 397, pp. 305-316. Springer-Verlag.
25. Martin, U. and Nipkow, T. (1990) Automating Squiggol. In: M. Broy and C. Jones, editors, Proceedings of IFIP Working Group 2.2, pp. 233-246. North Holland.
26. O'Donnell, J. (1994) A correctness proof of parallel scan. Parallel Process. Lett., 4(3), 329-338.
27. O'Donnell, J. and Rünger, G. (1997) A methodology for deriving parallel programs with a family of abstract parallel machines. In: C. Lengauer, M. Griebl and S. Gorlatch, editors, Parallel Processing. Euro-Par'97: Lecture Notes in Computer Science 1300, pp. 661-668. Springer-Verlag.
28. Plotkin, G. D. (1970) Lattice-theoretic properties of subsumption. Technical Report Memo MIP-R-77, University of Edinburgh.
29. Quinn, M. J. (1994) Parallel Computing. McGraw-Hill.
30. Skillicorn, D. (1994) Foundations of Parallel Programming. Cambridge University Press.
31. Smith, D. (1987) Applications of a strategy for designing divide-and-conquer algorithms. Science of Computer Programming, (8), 213-229.
32. Thomas, M. and Watson, P. (1993) Solving divergence in Knuth-Bendix completion by enriching signatures. Theoret. Comput. Sci., 112(1), 145-185.
33. Trinder, P., Hammond, K., Loidl, H.-W. and Jones, S. P. (1998) Algorithm + strategy = parallelsim. J. Functional Programming, 8(1), 23-60.