Communicating sequential processes
Communications of the ACM
Some ideas on data types in high-level languages
Communications of the ACM
Abstraction and verification in Alphard: defining and specifying iteration and generators
Communications of the ACM
Communications of the ACM
Behavioral semantics of nonrecursive control structures
Programming Symposium, Proceedings Colloque sur la Programmation
On the transfer of control between contexts
Programming Symposium, Proceedings Colloque sur la Programmation
ACM '78 Proceedings of the 1978 annual conference
An outline of a mathematical model for the definition and manipulation of data
Proceedings of the 1976 conference on Data : Abstraction, definition and structure
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
ACM SIGPLAN Notices
ACM SIGPLAN Notices
Further comments on "a view of coroutines"
ACM SIGPLAN Notices
ACM SIGPLAN Notices
Preliminary Ada reference manual
ACM SIGPLAN Notices - Preliminary Ada reference manual
Report on the programming language Euclid
ACM SIGPLAN Notices
| Hi-index | 0.00 |
Iterators provide access to elements of an abstract structured object in some sequence. It is argued that parallel composition of iterators should be achieved implicitly by means of a generalized for loop rather than by use of mutually interacting coroutines. The generalized for loop employs controlled iteration, which is shown to be a powerful yet inexpensive construct. The generalized for loop is consistent with block structure, and, for program proof purposes, is much more tractable than an unrestricted loop. Concrete programming examples are used extensively.