ACM Home Page
Please provide us with feedback. Feedback
Iteration abstraction in Sather
Full text PdfPdf (176 KB)
Source ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 18 ,  Issue 1  (January 1996) table of contents
Pages: 1 - 15  
Year of Publication: 1996
ISSN:0164-0925
Authors
Stephan Murer  International Computer Science Institute, Berkeley, CA
Stephen Omohundro  International Computer Science Institute, Berkeley, CA
David Stoutamire  International Computer Science Institute, Berkeley, CA
Clemens Szyperski  International Computer Science Institute, Berkeley, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 47,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/225540.225541
What is a DOI?

ABSTRACT

Sather extends the notion of an iterator in a powerful new way. We argue that iteration abstractions belong in class interfaces on an equal footing with routines. Sather iterators were derived from CLU iterators but are much more flexible and better suited for object-oriented programming. We retain the property that iterators are structured, i.e., strictly bound to a controlling structured statement. 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 experiences with iterators in the Sather compiler and libraries.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
Goos, G. 1994. Sather-K. Tech. Rep. 8/94, Faculty of Computer Science, University of Karlsruhe, Karlsruhe, Germany.
 
5
HEWITT, C. 1977. Viewing control structures as patterns of passing messages. Artif. Intell. 8, 323-364.
 
6
 
7
 
8
 
9
MCDERMOTT, D. V. AND SUSSMAN, G. J. 1974. The Conniver reference manual. Tech. Rep. Artificial Intelligence Memo 259a, MIT, Cambridge, Mass.
 
10
 
11
iV{URER, S., FELDMAN, J. A., ElM, C.-C., AND SEIDEL, M.-M. 1993. pSather: Layered extensions to an object-oriented language for efficient parallel computation. Tech. Rep. TR-93-028, International Computer Science Institute, Berkeley, Calif.
 
12
NEWELL, t. AND TONGE, F. iV{. 1960. An introduction to Information Processing Language V. Tech. Rep. Paper P-1929, The RAND Corp., Los Angeles, Calif. Presented at the ACM National Conference, Boston, 1959.
 
13
OMOHUNDRO, S. AND LIM, C.-C. 1992. The Sather language and libraries. Tech. Rep. TR-92-017, International Computer Science Institute, Berkeley, Calif.
 
14
 
15
STOUTAMIRE, D. AND OMOHUNDRO, S. 1995. Sather 1.1. Tech. rep., International Computer Science Institute, Berkeley, Calif. Available at http://www.icsi, berkeley.edu/Sather.
 
16
 
17
SZYPERSKI, C. A. 1992. Insight ETHOS: On Object-Orientation in Operating Systems. Informatik- Dissertationen ETH Ziirich. Vol. 40. Verlag der Fachvereine, Zurich, Switzerland.
 
18
 
19



REVIEW

"Arthur Gittleman : Reviewer"

Sather is an object-oriented language derived from Eiffel. Sather iterators, described here, derive from CLU but remove some limitations of CLU iterators, such as there being one iterator per loop; there being no way to modify elem  more...

Collaborative Colleagues:
Stephan Murer: colleagues
Stephen Omohundro: colleagues
David Stoutamire: colleagues
Clemens Szyperski: colleagues