Technical Report

 

Composition and compilation in functional programming languages Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/technical_reports/fj2363544

Descriptions

Attribute NameValues
Alternative Title
Creator
Abstract
  • Functional programming languages, such as Backus' FP, and high level expression oriented languages, such as APL, are examples of programming languages in which the primary method of program construction is the process of composition. In this paper we describe an approach to generating code for languages based on compositions. The approach involves finding an intermediate representation which grows in size very slowly as additional terms are composed. In particular, the size of the intermediate representation of a composed object should be considerably smaller, and easier to interpret, than the sum of the sizes of the internal representations of the individual elements. We illustrate this technique by showing how to generate conventional code for Backus' language FP. The general technique, however, is applicable to other languages, as well as other architectures.
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-06T17:00:56Z (GMT) No. of bitstreams: 1 Composition and compilation in functional programming languages.pdf: 199025 bytes, checksum: becc5cc68dacb066058bb88e84ab1f35 (MD5)
  • description.provenance : Made available in DSpace on 2012-04-06T17:00:56Z (GMT). No. of bitstreams: 1 Composition and compilation in functional programming languages.pdf: 199025 bytes, checksum: becc5cc68dacb066058bb88e84ab1f35 (MD5) Previous issue date: 1998-07-10
  • description.provenance : Submitted by Laura Wilson (laura.wilson@oregonstate.edu) on 2012-04-06T16:58:41Z No. of bitstreams: 1 Composition and compilation in functional programming languages.pdf: 199025 bytes, checksum: becc5cc68dacb066058bb88e84ab1f35 (MD5)

Relationships

Parents:

This work has no parents.

Items