Year: 1988
Type: article
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.
Source: ACM SIGPLAN Notices
DOI: 10.1145/44326.44333
Authors: S. M. Sarwar, S. J. Hahn, J. A. Davis
Institution: Iowa State University
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2056485362