DSpace Repository

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

Show simple item record

dc.creator Waters, Richard C.
dc.date 2004-10-04T14:57:38Z
dc.date 2004-10-04T14:57:38Z
dc.date 1988-03-01
dc.date.accessioned 2013-10-09T02:45:36Z
dc.date.available 2013-10-09T02:45:36Z
dc.date.issued 2013-10-09
dc.identifier AIM-959a
dc.identifier http://hdl.handle.net/1721.1/6474
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description 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.
dc.format 10571150 bytes
dc.format 8313613 bytes
dc.format application/postscript
dc.format application/pdf
dc.language en_US
dc.relation AIM-959a
dc.title Obviously Synchronizable Series Expressions: Part II: Overview of the Theory and Implementation


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account