Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. Artificial Intelligence Lab Publications
  4. AI Memos (1959 - 2004)
  5. Optimization of Series Expressions: Part II: Overview of the Theory and Implementation

Optimization of Series Expressions: Part II: Overview of the Theory and Implementation

Thumbnail Image
Download
Name

AIM-1083.pdf

Size

4.1 MB

Format

Adobe PDF

Checksum (MD5)

8198447d87b013b1a73cc411d22060cc

Thumbnail Image
Download
Name

AIM-1083.ps

Size

5.24 MB

Format

PostScript

Checksum (MD5)

06fa43d78282a3baabdb82bda88d8f4a

Author(s)
Waters, Richard C.
Date Issued
January 1, 1989
Series/Report no.
AIM-1083
Abstract
The benefits of programming in a functional style are well known. In particular, algorithms that are expressed as compositions of functions operating on series/vectors/streams of data elements are much easier to understand and modify than equivalent algorithms expressed as loops. Unfortunately, many programmers hesitate to use series expressions, because they are typically implemented very inefficiently---the prime source of inefficiency being the creation of intermediate series objects. A restricted class of series expressions, obviously synchronizable series expressions, is defined which can be evaluated very efficiently. At the cost of introducing restrictions which place modest limits on the series expressions which can be written, the restrictions guarantee that the creation of intermediate series objects is never necessary. This makes it possible to automatically convert obviously synchronizable series expressions into highly efficient loops using straight forward algorithms.
Subjects
series expressions
looping constructs
compilation
programsoptimization
functional programming
Persistent DSpace Link
http://hdl.handle.net/1721.1/6031
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.