EXPERIMENTS IN DIFFUSED COMBINATOR REDUCTION.

Paul Hudak, Benjamin Goldberg

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In recent years there has been a fair amount of interest both in using combinators to represent functional programs, and in using graph reduction as an underlying evaluation strategy. Combining these ideas within a single framework for an 'applicative architecture' is very appealing because: (1) the normally ubiquitous 'environment' is eliminated, (2) the evaluation strategy becomes very simple (amenable to VLSI), and (3) there is a great potential for parallelism. We have been exploring a model of diffused combinator reduction in which the reduction process is distributed 'by demand' among a network of closely-coupled processors. We have tested our ideas via simulation, with encouraging results.

Original languageEnglish (US)
Title of host publicationUnknown Host Publication Title
PublisherACM
Pages167-176
Number of pages10
ISBN (Print)0897911423, 9780897911429
DOIs
StatePublished - 1984

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'EXPERIMENTS IN DIFFUSED COMBINATOR REDUCTION.'. Together they form a unique fingerprint.

  • Cite this

    Hudak, P., & Goldberg, B. (1984). EXPERIMENTS IN DIFFUSED COMBINATOR REDUCTION. In Unknown Host Publication Title (pp. 167-176). ACM. https://doi.org/10.1145/800055.802033