Comments on “distributed computation by graph reduction” by r. m. keller: Response to distributed computation by graph reduction

Abstract

Robert Keller's “Distributed Computation by Graph Reduction” promotes the use of distributed graph reduction to implement functional languages on highly parallel computers. In examining the potential for parallelism in FEL, however, the paper appeals to terminology and ideas associated with: Graph reduction theory, lambda calculus, distributed processing, computer architecture, and parallel machine organization. The suggested tie between functional paradigms and parallel machine organizations is sometimes obscured by the density of italicized terms and concepts. Those “only familiar with Fortran‐like languages” may find it challenging reading indeed. Copyright © 1985 John Wiley & Sons, Ltd.