Iteration and abstract data types

Authors:
J D Eckart
Affiliations:
Georgia Institute of Technology
Venue:
ACM SIGPLAN Notices
Year:
1987

Citing 5
Cited 5

Smalltalk-80: the language and its implementation

Smalltalk-80: the language and its implementation
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Reference Manual for the ADA Programming Language

Reference Manual for the ADA Programming Language
CLU Reference Manual

CLU Reference Manual
Programming in Modula-2

Programming in Modula-2

Using formal procedure parameters to represent and transmit complex data structures

ACM SIGPLAN Notices
XE design rationale: Clu revisited

ACM SIGPLAN Notices
The Effect of Data Abstraction on Loop Programming Techniques

IEEE Transactions on Software Engineering
Automatic transformation of series expressions into loops

ACM Transactions on Programming Languages and Systems (TOPLAS)
An iterator construct for the refinement calculus

IW-FM'00 Proceedings of the 4th Irish conference on Formal Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

Numerous languages have been developed which support the creation of abstract data types. Introductions to such languages typically provide the standard stack and complex number examples to demonstrate their respective expressive power. While such examples fit neatly into the framework of these languages, only a few have attempted to deal with the problems of iterating through an abstraction, such as the elements of a list. Two approaches to this problem are examined: action importation and data exportation. It is shown that data exportation is the more flexible of the two and a language construct supporting it is presented.