Implementing functional languages on a combinator-based reduction machine

Authors:
S. M. Sarwar;S. J. Hahn;J. A. Davis
Affiliations:
Iowa State University, Ames;Iowa State University, Ames;Iowa State University, Ames
Venue:
ACM SIGPLAN Notices
Year:
1988

Citing 2
Cited 1

Serial combinators: “optimal” grains of parallelism

Proc. of a conference on Functional programming languages and computer architecture
Super-combinators a new implementation method for applicative languages

LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming

Linear logic and permutation stacks—the Forth shall be first

ACM SIGARCH Computer Architecture News - Special issue: panel sessions of the 1991 workshop on multithreaded computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes the results of a study done at Iowa State University as part of a larger effort to develop a fine-grained parallel architecture [5]. The goal is to find most heavily used combinators using Turner's method of graph reduction for a wide range of programming styles. The study shows thai there are families and strings of combinators that are used frequently. Optimization of such combinators promises an efficient sequential reduction machine based upon the combinator model.