论文信息 - A Safe Approach to Parallel Combinator Reduction (Extended Abstract)

A Safe Approach to Parallel Combinator Reduction (Extended Abstract)

In this paper we present the results of two pieces of work which, when combined, allow us to go from a program text in a functional language to a parallel implementation of that program. We present techniques for discovering sources of parallelism in a program at compile time, and then show how this parallelism is naturally mapped into a parallel combinator set that we will define.

Simon L. Peyton Jones | Chris Hankin | Geoffrey L. Burn

[1] D. A. Turner. Another Algorithm for Bracket Abstraction , 1979, J. Symb. Log..

[2] Dana S. Scott,et al. Outline of a Mathematical Theory of Computation , 1970 .

[3] Chris Hankin,et al. COBWEB - A Combinator Reduction Architecture , 1985, FPCA.

[4] Alan Mycroft,et al. Abstract interpretation and optimising transformations for applicative programs , 1982 .

[5] F. Warren Burton,et al. Efficient Combinator Code , 1985, Comput. Lang..

[6] Silvio Romero de Lemos Meira,et al. On the efficiency of applicative algorithms , 1985 .