LetS: An Expressional Loop Notation
Many 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...
| Main Author: | |
|---|---|
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://hdl.handle.net/1721.1/6369 |
| _version_ | 1826189002935369728 |
|---|---|
| author | Waters, Richard C. |
| author_facet | Waters, Richard C. |
| author_sort | Waters, Richard C. |
| collection | MIT |
| description | Many 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. |
| first_indexed | 2024-09-23T08:07:59Z |
| id | mit-1721.1/6369 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T08:07:59Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | mit-1721.1/63692019-04-09T16:50:49Z LetS: An Expressional Loop Notation Waters, Richard C. Many 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. 2004-10-04T14:53:47Z 2004-10-04T14:53:47Z 1983-02-01 AIM-680a http://hdl.handle.net/1721.1/6369 en_US AIM-680a 57 p. 23513607 bytes 3599639 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | Waters, Richard C. LetS: An Expressional Loop Notation |
| title | LetS: An Expressional Loop Notation |
| title_full | LetS: An Expressional Loop Notation |
| title_fullStr | LetS: An Expressional Loop Notation |
| title_full_unstemmed | LetS: An Expressional Loop Notation |
| title_short | LetS: An Expressional Loop Notation |
| title_sort | lets an expressional loop notation |
| url | http://hdl.handle.net/1721.1/6369 |
| work_keys_str_mv | AT watersrichardc letsanexpressionalloopnotation |