A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A Parallel Intermediate Representation based on Lambda Expressions
[chapter]
1991
Arrays, Functional Languages, and Parallel Systems
Preserved Fulltext
The lambda calculus has frequently been used as an intermediate representation for programming languages, particularly for functional programming language systems. We introduce two simple extensions to the lambda calculus that describe potentially parallel computations. These extensions permit us to use the lambda calculus as an intermediate form for languages that operate on large data items as single entities, such as FP or APL. We conclude by discussing how this intermediate representation
doi:10.1007/978-1-4615-4002-1_9
fatcat:7ocv3zlv45c4jbtc7broq5rxby