학술논문
Harnessing computational power: distributed combinator reduction
Document Type
Conference
Author
Source
Conference: ARO workshop on new computing environments: parellel, vector and systolic, Stanford, CA, USA, 7 Nov 1984
Subject
Language
English
ISSN
85005967
Abstract
Much interest has been generated by the notion of combinator graph reduction as a mechanism for the implementation of functional languages. An effort is currently in progress at Los Alamos National Laboratory, in collaboration with Paul Hudak of Yale University, to develop a testbed distributed implementation of a functional language based on this concept. Our overall goal is to facilitate the exploitation of implicit parallelism; within this framework, we intend to use this testbed to evaluate the utility of strategies for combinator graph reduction in a distributed computing system.