Sather iters are a powerful new way to encapsulate iteration. We argue that such iteration abstractions belong in a class' interface on an equal footing with its routines. Sather iters were derived from CLU iterators but are much more flexible and better suited for object-oriented programming. We motivate and describe the construct along with several simple examples. We compare it with iteration based on CLU iterators, cursors, riders, streams, series, generators, coroutines, blocks, closures, and lambda expressions. Finally, we describe how to implement them in terms of coroutines and then show how to transform this implementation into efficient code
Iteration is a programming operation that traditionally refers to visiting the elements of a data st...
A technique for synthesizing iterators from declarative abstraction functions written in a relationa...
Transforming recursion into iteration eliminates the use of stack frames during program ex-ecution. ...
ion in Sather STEPHAN MURER, STEPHEN OMOHUNDRO, DAVID STOUTAMIRE, and CLEMENS SZYPERSKI Internationa...
I describe an iteration macro for Common Lisp that is clear, efficient, extensible, and in excellent...
International audienceIn this paper we present an approach to specify programs performing iterations...
The Iterator pattern gives a clean interface for element-by-element access to a collection, independ...
closely related to closures since they too can be nested in methods and classes. Their translation s...
The Iterator pattern gives a clean interface for element-by-element access to a collection, independ...
AbstractWe analyse the conventional sum-based representation of iteration from the perspective of pr...
The Iterator pattern gives a clean interface for element-by-element access to a collection. Imperati...
A technique for synthesizing iterators from declarative abstraction functions written in a relationa...
Many visual programming languages (VPLs) rely on the data-flow paradigm, probably because of its sim...
The need to parallelise desktop applications is becom-ing increasingly essential with the mainstream...
In this paper we discuss computational abstraction steps as a way to create class abstractions from ...
Iteration is a programming operation that traditionally refers to visiting the elements of a data st...
A technique for synthesizing iterators from declarative abstraction functions written in a relationa...
Transforming recursion into iteration eliminates the use of stack frames during program ex-ecution. ...
ion in Sather STEPHAN MURER, STEPHEN OMOHUNDRO, DAVID STOUTAMIRE, and CLEMENS SZYPERSKI Internationa...
I describe an iteration macro for Common Lisp that is clear, efficient, extensible, and in excellent...
International audienceIn this paper we present an approach to specify programs performing iterations...
The Iterator pattern gives a clean interface for element-by-element access to a collection, independ...
closely related to closures since they too can be nested in methods and classes. Their translation s...
The Iterator pattern gives a clean interface for element-by-element access to a collection, independ...
AbstractWe analyse the conventional sum-based representation of iteration from the perspective of pr...
The Iterator pattern gives a clean interface for element-by-element access to a collection. Imperati...
A technique for synthesizing iterators from declarative abstraction functions written in a relationa...
Many visual programming languages (VPLs) rely on the data-flow paradigm, probably because of its sim...
The need to parallelise desktop applications is becom-ing increasingly essential with the mainstream...
In this paper we discuss computational abstraction steps as a way to create class abstractions from ...
Iteration is a programming operation that traditionally refers to visiting the elements of a data st...
A technique for synthesizing iterators from declarative abstraction functions written in a relationa...
Transforming recursion into iteration eliminates the use of stack frames during program ex-ecution. ...