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. Obviously Synchronizable Series Expressions: Part II: Overview of the Theory and Implementation

Obviously Synchronizable Series Expressions: Part II: Overview of the Theory and Implementation

Thumbnail Image
Download
Name

AIM-959a.pdf

Size

7.93 MB

Format

Adobe PDF

Checksum (MD5)

877d0a1fe13a1ff35ab3dea6ac1f6776

Thumbnail Image
Download
Name

AIM-959a.ps

Size

10.08 MB

Format

PostScript

Checksum (MD5)

c6cee0b7084b6cd518efb3df351849fd

Author(s)
Waters, Richard C.
Date Issued
March 1, 1988
Series/Report no.
AIM-959a
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 straightforward algorithms.
Persistent DSpace Link
http://hdl.handle.net/1721.1/6474
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.