Show simple item record

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

dc.date.accessioned2004-10-04T14:36:23Z
dc.date.accessioned2018-11-24T10:11:36Z
dc.date.available2004-10-04T14:36:23Z
dc.date.available2018-11-24T10:11:36Z
dc.date.issued1989-01-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6031
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6031
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 straight forward algorithms.en_US
dc.format.extent50 p.en_US
dc.format.extent5496058 bytes
dc.format.extent4301783 bytes
dc.language.isoen_US
dc.subjectseries expressionsen_US
dc.subjectlooping constructsen_US
dc.subjectcompilationen_US
dc.subjectprogramsoptimizationen_US
dc.subjectfunctional programmingen_US
dc.titleOptimization of Series Expressions: Part II: Overview of the Theory and Implementationen_US


Files in this item

FilesSizeFormatView
AIM-1083.pdf4.301Mbapplication/pdfView/Open
AIM-1083.ps5.496Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record