The Iterator pattern gives a clean interface for element-by-element access to a collection. Imperative iterations using the pattern have two simultaneous aspects: mapping and accumulating. Various functional iterations model one or other of these, but not both simultaneously. We argue that McBride and Paterson's idioms, and in particular the corresponding traverse operator, do exactly this, and therefore capture the essence of the Iterator pattern. We present some axioms for traversal, and illustrate with a simple example, the repmin problem
A recent paper by Graham Hutton and Diana Fulger (\"Reasoning about Effects: Seeing the Wood through...
. Reasoning on programs and automated deduction often require the manipulation of infinite sets of o...
The bounded-iteration construct foreach x in Rjp do t od is very commonly used in database programmi...
The Iterator pattern gives a clean interface for element-by-element access to a collection, independ...
The Iterator pattern gives a clean interface for element-by-element access to a collection, independ...
The ITERATOR pattern gives a clean interface for element-by-element access to a collection. Imper-at...
The Iterator design pattern allows client code to access the elements of an aggregate object sequen...
ion in Sather STEPHAN MURER, STEPHEN OMOHUNDRO, DAVID STOUTAMIRE, and CLEMENS SZYPERSKI Internationa...
Iteration is a programming operation that traditionally refers to visiting the elements of a data st...
Sather iters are a powerful new way to encapsulate iteration. We argue that such iteration abstracti...
International audienceIn this paper we present an approach to specify programs performing iterations...
closely related to closures since they too can be nested in methods and classes. Their translation s...
Iterative characterizations of computable unary functions are useful patterns for the definition of ...
. In a simply-typed, call-by-value (CBV) language with first-class continuations, the usual CBV fixp...
A complete traversal of a container C (such as a set) is informally described by the iteration schem...
A recent paper by Graham Hutton and Diana Fulger (\"Reasoning about Effects: Seeing the Wood through...
. Reasoning on programs and automated deduction often require the manipulation of infinite sets of o...
The bounded-iteration construct foreach x in Rjp do t od is very commonly used in database programmi...
The Iterator pattern gives a clean interface for element-by-element access to a collection, independ...
The Iterator pattern gives a clean interface for element-by-element access to a collection, independ...
The ITERATOR pattern gives a clean interface for element-by-element access to a collection. Imper-at...
The Iterator design pattern allows client code to access the elements of an aggregate object sequen...
ion in Sather STEPHAN MURER, STEPHEN OMOHUNDRO, DAVID STOUTAMIRE, and CLEMENS SZYPERSKI Internationa...
Iteration is a programming operation that traditionally refers to visiting the elements of a data st...
Sather iters are a powerful new way to encapsulate iteration. We argue that such iteration abstracti...
International audienceIn this paper we present an approach to specify programs performing iterations...
closely related to closures since they too can be nested in methods and classes. Their translation s...
Iterative characterizations of computable unary functions are useful patterns for the definition of ...
. In a simply-typed, call-by-value (CBV) language with first-class continuations, the usual CBV fixp...
A complete traversal of a container C (such as a set) is informally described by the iteration schem...
A recent paper by Graham Hutton and Diana Fulger (\"Reasoning about Effects: Seeing the Wood through...
. Reasoning on programs and automated deduction often require the manipulation of infinite sets of o...
The bounded-iteration construct foreach x in Rjp do t od is very commonly used in database programmi...