Efficient High-level Iteration with Accumulators

Efficient High-level Iteration with Accumulators (1989)

by Robert D. Cameron

Venue:	ACM Transactions on Programming Languages and Systems
Citations:	4 - 0 self

Datum	Value	Source
TITLE	Efficient High-level Iteration with Accumulators	INFERENCE
AUTHOR NAME	Robert D. Cameron	SVM HeaderParse 0.2
ABSTRACT	Accumulators are proposed as a new type of high-level iteration construct for imperative languages. Accumulators are user-programmed mechanisms for successively combining a sequence of values into a single result value. The accumulated result can either be a simple numeric value such as the sum of a series or a data structure such as a list. Accumulators naturally complement constructs that allow iteration through user-programmed sequences of values such as the iterators of CLU and the generators of Alphard. A practical design for high-level iteration is illustrated by way of an extension to Modula-2 called Modula Plus. The extension incorporates both a redesigned mechanism for iterators as well as the accumulator design. Several applications are illustrated including both numeric and data structure accumulation. It is shown that the design supports efficient iteration both because it is amenable to implementation via in-line coding and because it allows high-level iteration concepts to be implemented as encapsulations of efficient low-level manipulations.	SVM HeaderParse 0.2
YEAR	1989	INFERENCE
VENUE	ACM Transactions on Programming Languages and Systems	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	19--4	INFERENCE
VOLUME	1989	INFERENCE
CITATIONS	9 found	ParsCit 1.0