Show simple item record

dc.contributor.authorWaters, Richard C.en_US
dc.date.accessioned2004-10-04T14:57:36Z
dc.date.available2004-10-04T14:57:36Z
dc.date.issued1987-11-01en_US
dc.identifier.otherAIM-959en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6473
dc.description.abstractThe 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.en_US
dc.format.extent9871840 bytes
dc.format.extent7762862 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesAIM-959en_US
dc.titleSynchronizable Series Expressions: Part II: Overview of the Theory and Implementationen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record