A parallel intermediate representation based on Lambda expressions Public Deposited

http://ir.library.oregonstate.edu/concern/technical_reports/8623hz982

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • 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
Date Available
Date Issued
Series
Subject
Rights Statement
Publisher
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2012-04-09T16:03:12Z (GMT) No. of bitstreams: 1 A parallel intermediate representation based on Lamda expression.pdf: 152262 bytes, checksum: 1ca1cca2cb093a3ac59e9384e681c8ef (MD5)
  • description.provenance : Made available in DSpace on 2012-04-09T16:03:12Z (GMT). No. of bitstreams: 1 A parallel intermediate representation based on Lamda expression.pdf: 152262 bytes, checksum: 1ca1cca2cb093a3ac59e9384e681c8ef (MD5) Previous issue date: 1998-07-10
  • description.provenance : Submitted by Laura Wilson (laura.wilson@oregonstate.edu) on 2012-04-09T16:01:57Z No. of bitstreams: 1 A parallel intermediate representation based on Lamda expression.pdf: 152262 bytes, checksum: 1ca1cca2cb093a3ac59e9384e681c8ef (MD5)

Relationships

In Administrative Set:
Last modified: 07/18/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items