Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6473Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Waters, Richard C. | - |
| dc.date | 2004-10-04T14:57:36Z | - |
| dc.date | 2004-10-04T14:57:36Z | - |
| dc.date | 1987-11-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-959 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6473 | - |
| 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 | 9871840 bytes | - |
| dc.format | 7762862 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-959 | - |
| dc.title | Synchronizable Series Expressions: Part II: Overview of the Theory and Implementation | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.