Source program optimization with a generalized FOR statement

Lichtman, Zavdi L.

doi:10.1007/bf01932023

Search citation statements

Order By: Relevance

Paper Sections

Select...

Related Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1980

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The use of multiple iterators in the same loop has been investigated [18,6], but no consideration has been given to synchronization.…”

Section: Related Workmentioning

confidence: 99%

Data abstraction, controlled iteration, and communicating processes

Berztiss¹

1980

Proceedings of the ACM 1980 Annual Conference on - ACM 80

View full text Add to dashboard Cite

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. i. Data structures and iterationWhen a programming language permits the specification of abstract data types, there arises the question of how much properly belongs to the specification.Our intent is to contribute to the answer to this question.For the purposes of this discussion it will be assumed that a data type is visible to a programmer merely as the values delivered by a set of access functions.

show abstract

“…The use of multiple iterators in the same loop has been investigated [18,6], but no consideration has been given to synchronization.…”

Section: Related Workmentioning

confidence: 99%