Parallelizing functional programs by generalization

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

Volumn 1298, Issue , 1997, Pages 46-60

  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

ALGEBRA; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE;

DIVIDE AND CONQUER; FUNCTIONAL PROGRAMS; LIST-HOMOMORPHISMS; PARALLEL PREFIX; PARALLELIZATIONS; PARALLELIZING; TERM REWRITING TECHNIQUES;

COMPUTER CIRCUITS;

EID: 35448966149     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0027002     Document Type: Conference Paper

References (20)

1. Leo Bachmair. Canonical Equational Proofs. Research Notes in Theoretical Computer Science, Wiley and Sons, 1989.
2. D. Barnard, J. Schmeiser, and D. Skillicorn. Deriving associative operators for language recognition. Bulletin of EATGS, 43:131-139, 1991.
3. R. S. Bird. Lectures on constructive functional programming. In M. Broy, editor, Constructive Methods in Computing Science, NATO ASI Series F: Computer and Systems Sciences. Vol. 55, pages 151-216. Springer Verlag, 1988.
4. G. Blelloch. Scans as primitive parallel operations. IEEE Trans, on Computers, 38(11):1526-1538, November 1989.
5. Hubert Comon, Marianne Haberstrau, and Jean-Pierre Jouannaud. Syntacticness, cycle-syntacticness, and shallow theories. Inform, and Computation, 111:154-191, 1994.
6. Ulrich Fraus and Heinrich Hufimann. 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, Oxford, UK, 1992. Clarendon Press.
7. A. Geser and S. Gorlatch. Parallelizing functional programs by term rewriting. Technical Report MIP-9709, Universität Passau, April 1997. Available from http://bralims.fmi.uni-passau.de/cl/papers/GesGor97a.html.
8. Alfons Geser. Mechanized inductive proof of properties of a simple code optimizer. In Peter D. Mosses, Mogens Nielsen, and Michael I. Schwartzbach, editors, Proc. 6th Theory and Practice in Software Development (TAPSOFT), LNCS 915, pages 605-619. Springer, 1995.
9. J. Gibbons. The third homomorphism theorem. J. Fun. Programming, 6(4):657-665, 1996.
10. S. Gorlatch. Constructing list homomorphisms. Technical Report MIP-9512, Universität Passau, August 1995.
11. S. Gorlatch. Systematic efficient parallelization of scan and other list homomorphisms. In L. Bouge, P. Fraigniaud, A. Mignotte, and Y. Rxłbert, editors, Euro-Par '96. Parallel Processing, Lecture Notes in Computer Science 1124, pages 401-408. Springer-Verlag, 1996.
12. S. Gorlatch. 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, pages 274-288. Springer-Verlag, 1996.
13. S. Gorlatch and H. Bischof. 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, pages 80-94, 1997.
14. B. Heinz. Lemma discovery by anti-unification of regular sorts. Technical Report 94-21, TU Berlin, May 1994.
15. Jean-Pierre Jouannaud. Syntactic theories. In B. Rovan, editor, Mathematical Foundations of Computer Science, pages 15-25, Banská Bystrica, 1990. LNCS 452.
16. Steffen Lange. Towards a set of inference rules for solving divergence in Knuth-Bendix completion. In Klaus P. Jantke, editor, Proc. Analogical and Inductive Inference, pages 305-316. LNCS 397, 1989.
17. J. O'Donnell. A correctness proof of parallel scan. Parallel Processing Letters, 4(3):329-338, 1994.
18. Gordon D. Plotkin. Lattice-theoretic properties of subsumption. Technical Report Memo MIP-R-77, Univ. Edinburgh, UK, 1970.
19. D. Skillicorn. Foundations of Parallel Programming. Cambridge Univ. Press, 1994.
20. Mufíy Thomas and Phil Watson. Solving divergence in Knuth-Bendix completion by enriching signatures. Theoretical Computer Science, 112(1):145-185, 1993.