Iteration abstraction in Sather

Murer, Stephan; Omohundro, Stephen M.; Stoutamire, David; Szyperski, Clemens

doi:10.1145/225540.225541

Cited by 32 publications

(20 citation statements)

References 5 publications

(4 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The execution behavior of this approach is closer to that of CLU [10] and Sather [11] iterators. Another advantage over the sequence-based approach is that Chapel does not need to use storage for the iteration space.…”

Section: Nested Function Implementationmentioning

confidence: 81%

Iterators in Chapel

Joyner¹,

Chamberlain²,

Deitz³

2006

Proceedings 20th IEEE International Parallel &Amp; Distributed Processing Symposium

View full text Add to dashboard Cite

A long-held tenet of software engineering is that algorithms and data structures should be specified orthogonally in order to minimize the impact that changes to one will have on the other. Unfortunately, this principle is often not well-supported in scientific and parallel codes due to the lack of abstractions for factoring iteration away from computation in traditional scientific languages. The result is a fragile situation in which complex loop nests are used to express parallelism and maximize performance, yet must be maintained individually as the algorithm and data structures evolve. In this paper, we introduce the iterator concept in the Chapel parallel programming language, designed to address this problem and provide a means for factoring iteration away from computation. The paper illustrates iterators using several examples, compares our approach with those taken in other languages, and describes our implementation in the Chapel compiler.

show abstract

Section: Nested Function Implementationmentioning

confidence: 81%

Iterators in Chapel

Joyner¹,

Chamberlain²,

Deitz³

2006

Proceedings 20th IEEE International Parallel &Amp; Distributed Processing Symposium

View full text Add to dashboard Cite

show abstract

“…A complementary language extension that deals with this problem is that of iterator generators, a feature supported by other languages such as Python and Sather [27]. Like the enhanced for loop, this feature abstracts away from the underlying interfaces.…”

Section: Extension With Iterator Generatorsmentioning

confidence: 99%

Mixing source and bytecode

KatsLennart¹,

BravenboerMartin²,

Visser³

2008

SIGPLAN Not.

View full text Add to dashboard Cite

Language extensions increase programmer productivity by providing concise, often domain-specific syntax, and support for static verification of correctness, security, and style constraints. Language extensions can often be realized through translation to the base language, supported by preprocessors and extensible compilers. However, various kinds of extensions require further adaptation of a base compiler's internal stages and components, for example to support separate compilation or to make use of low-level primitives of the platform (e.g., jump instructions or unbalanced synchronization). To allow for a more loosely coupled approach, we propose an open compiler model based on normalization steps from a high-level language to a subset of it, the core language. We developed such a compiler for a mixed Java and (core) bytecode language, and evaluate its effectiveness for composition mechanisms such as traits, as well as statement-level and expression-level language extensions.

show abstract

“…CLU iterators [10] and their variants (e.g., Sather iterators [12] and Python generators [15]) are functions that are used to produce a sequence of values one-by-one for manipulation by clients. The body of an iterator function emits a value and yields control to the client.…”

Section: Related Workmentioning

confidence: 99%

Responders: Language Support for Interactive Applications

Chin

Millstein

2006

ECOOP 2006 – Object-Oriented Programming

View full text Add to dashboard Cite

Abstract.A variety of application domains are interactive in nature: a primary task involves responding to external actions. In this paper, we introduce explicit programming language support for interactive programming, via the concept of a responder. Responders include a novel control construct that allows the interactive logic of an application to be naturally and modularly expressed. In contrast, the standard approaches to interactive programming, based on the event-driven style or the state design pattern, fragment this logic across multiple handlers or classes, with the control flow among fragments expressed only indirectly. We describe ResponderJ, an extension to Java supporting responders. A responder is simply a class with additional abilities, and these abilities interact naturally with the existing features of classes, including inheritance. We have implemented ResponderJ as an extension to the Polyglot compiler for Java. We illustrate ResponderJ's utility in practice through two case studies: the implementation of a GUI supporting drag-and-drop functionality, and a re-implementation of the control logic of JDOM, a Java library for parsing and manipulating XML files.

show abstract

Iteration abstraction in Sather

Cited by 32 publications

References 5 publications

Iterators in Chapel

Iterators in Chapel

Mixing source and bytecode

Responders: Language Support for Interactive Applications

Contact Info

Product

Resources

About