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
StatePublished - 1984

Fingerprint

Experiments

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Hudak, P., & Goldberg, B. (1984). EXPERIMENTS IN DIFFUSED COMBINATOR REDUCTION. In Unknown Host Publication Title (pp. 167-176). ACM.

EXPERIMENTS IN DIFFUSED COMBINATOR REDUCTION. / Hudak, Paul; Goldberg, Benjamin.

Unknown Host Publication Title. ACM, 1984. p. 167-176.

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

Hudak, P & Goldberg, B 1984, EXPERIMENTS IN DIFFUSED COMBINATOR REDUCTION. in Unknown Host Publication Title. ACM, pp. 167-176.
Hudak P, Goldberg B. EXPERIMENTS IN DIFFUSED COMBINATOR REDUCTION. In Unknown Host Publication Title. ACM. 1984. p. 167-176
Hudak, Paul ; Goldberg, Benjamin. / EXPERIMENTS IN DIFFUSED COMBINATOR REDUCTION. Unknown Host Publication Title. ACM, 1984. pp. 167-176
@inproceedings{7f4b0d57b1224f50a3b2334a8f7375f4,
title = "EXPERIMENTS IN DIFFUSED COMBINATOR REDUCTION.",
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.",
author = "Paul Hudak and Benjamin Goldberg",
year = "1984",
language = "English (US)",
isbn = "0897911423",
pages = "167--176",
booktitle = "Unknown Host Publication Title",
publisher = "ACM",

}

TY - GEN

T1 - EXPERIMENTS IN DIFFUSED COMBINATOR REDUCTION.

AU - Hudak, Paul

AU - Goldberg, Benjamin

PY - 1984

Y1 - 1984

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0021651060&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0021651060&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0897911423

SP - 167

EP - 176

BT - Unknown Host Publication Title

PB - ACM

ER -