ACM Home Page
Please provide us with feedback. Feedback
Programming with abstract data types
Full text PdfPdf (964 KB)
Source ACM SIGPLAN Notices archive
Volume 9 ,  Issue 4  (April 1974) table of contents
Pages: 50 - 59  
Year of Publication: 1974
ISSN:0362-1340
Also published in ...
Authors
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 102,   Citation Count: 180
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/942572.807045
What is a DOI?

ABSTRACT

The motivation behind the work in very-high-level languages is to ease the programming task by providing the programmer with a language containing primitives or abstractions suitable to his problem area. The programmer is then able to spend his effort in the right place; he concentrates on solving his problem, and the resulting program will be more reliable as a result. Clearly, this is a worthwhile goal. Unfortunately, it is very difficult for a designer to select in advance all the abstractions which the users of his language might need. If a language is to be used at all, it is likely to be used to solve problems which its designer did not envision, and for which the abstractions embedded in the language are not sufficient. This paper presents an approach which allows the set of built-in abstractions to be augmented when the need for a new data abstraction is discovered. This approach to the handling of abstraction is an outgrowth of work on designing a language for structured programming. Relevant aspects of this language are described, and examples of the use and definitions of abstractions are given.


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
Wirth, N. The programming language PASCAL. Acta Informatica, Vol. 1 (1971), pp 35-63.
 
2
Parnas, D. L. Information distribution aspects of design methodology, Proceedings of the IFIP Congress, August 1971.
 
3
Dijkstra, E. W. Notes on structured programming. Structured Programming, A.P.I.C. Studies in Data Processing, No. 8, Academic Press, New York, 1972, pp 1-81.
 
4
Schuman, S. A. and P. Jorrand. Definition mechanisms in extensible programming languages. Proceedings of the AFIPS, Vol. 37, 1970, pp 9-19.
 
5
Mealy, G. Another look at data. Proceedings of the AFIPS, Vol. 31, 1967, pp 525-534.
 
6
Balzer, R. M. Dataless programming. Proceedings of the AFIPS, Vol. 31, 1967, pp 557-566.
7
 
8
 
9
Daley, R. C., and P. G. Neumann. A general purpose file system for secondary storage. Proceedings of the AFIPS, Vol. 27, 1965, pp 213-229.
10
11
 
12
Reynolds, J. Personal communication.
 
13
Liskov, B. H. A design methodology for reliable software systems. Proceedings of the AFIPS, Vol. 41, 1972, pp 191-199.

CITED BY  180