A parallel intermediate representation based on Lambda expressions

Technical Report

Public Deposited

Download PDF

Citeable URL: https://ir.library.oregonstate.edu/concern/technical_reports/8623hz982

Descriptions

Attribute Name	Values
Alternative Title	89-60-18
Creator	Oregon State University. Dept. of Computer Science Budd, Timothy
Abstract	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 can facilitate the generation of code for different types of parallel systems.
Resource Type	Research Paper
Date Available	2012-04-09T16:03:12+00:00
Date Issued	1998-07-10
Series	Technical report (Oregon State University. Department of Computer Science)
Subject	Functional programming (Computer science) Code generators Lambda calculus
Rights Statement	Copyright Not Evaluated
Publisher	Corvallis, OR : Oregon State University, Dept. of Computer Science
Peer Reviewed	No
Language	English [eng]
Replaces	http://hdl.handle.net/1957/28618
Accessibility Feature	unknown

Thumbnail	Title	Date Uploaded	Visibility	Actions
	A_parallel_intermediate_representation_based_on_Lamda_expression.pdf	2017-07-18	Public	Download