论文信息 - Complied Graph Reduction on a Processor Network

Complied Graph Reduction on a Processor Network

Compiled graph reduction has proven successful for the sequential implementation of functional programming languages. In order to use this method for parallel evaluation we developed a parallel abstract machine for the implementation of functional languages on a processor network. It is based on Th. Johnssons G-machine [Johnsson], an abstract machine performing compiled graph reduction.

[1] F. Warren Burton,et al. Speculative computation, parallelism, and functional programming , 1985, IEEE Transactions on Computers.

[2] Jon Fairbairn,et al. Code generation techniques for functional languages , 1986, LFP '86.

[3] Paul Hudak,et al. A combinator-based compiler for a functional language , 1984, POPL '84.

[4] Thomas Johnsson,et al. Efficient compilation of lazy evaluation , 1984, SIGPLAN '84.

[5] Robert M. Keller,et al. Distributed computation by graph reduction , 1985 .

[6] Chris Hankin,et al. The theory of strictness analysis for higher order functions , 1985, Programs as Data Objects.

[7] Geoffrey L. Burn,et al. Evaluation transformers - a model for the parallel evaluation of functional languages (extended abstract) , 1987, FPCA.

[8] Chris Hankin,et al. The theory and practice of strictness analysis for higher order functions , 1985 .

[9] Paul Hudak,et al. Serial Combinators: "Optimal" Grains of Parallelism , 1985, FPCA.

[10] Dieter Maurer,et al. Strictness computation using special lambda-expressions , 1985, Programs as Data Objects.