Show simple item record

LetS: An Expressional Loop Notation

dc.date.accessioned2004-10-04T14:53:47Z
dc.date.accessioned2018-11-24T10:13:06Z
dc.date.available2004-10-04T14:53:47Z
dc.date.available2018-11-24T10:13:06Z
dc.date.issued1983-02-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6369
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6369
dc.description.abstractMany loops can be more easily understood and manipulated if they are viewed as being built up out of operations on sequences of values. A notation is introduced which makes this viewpoint explicit. Using it, loops can be represented as compositions of functions operating on sequences of values. A library of standard sequence functions is provided along with facilities for defining additional ones. The notation is not intended to be applicable to every kind of loop. Rather, it has been simplified wherever possible so that straightforward loops can be represented extremely easily. The expressional form of the notation makes it possible to construct and modify such loops rapidly and accurately. The implementation of the notation does not actually use sequences but rather compiles loop expressions into iterative loop code. As a result, using the notation leads to no reduction in run time efficiency.en_US
dc.format.extent57 p.en_US
dc.format.extent23513607 bytes
dc.format.extent3599639 bytes
dc.language.isoen_US
dc.titleLetS: An Expressional Loop Notationen_US


Files in this item

FilesSizeFormatView
AIM-680a.pdf3.599Mbapplication/pdfView/Open
AIM-680a.ps23.51Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record