Cited By
View all- Wile DGeschke C(1972)An implementation base for efficient data structuringInternational Journal of Computer & Information Sciences10.1007/BF009774101:3(209-224)Online publication date: Sep-1972
Efficient data accessing in the programming language Bliss
Abstract
The specification of data structure in higher-level languages is isolated from the related specifications of data allocation and data type. Structure specification is claimed to be the definition of the accessing (addressing) function for items having the structure. Conventional techniques for data structure isolation in higher-level languages are examined and are found to suffer from a lack of clarity and efficiency.The means by which data structure accessors may be defined in Bliss, the specification of their association with named, allocated storage, and their automatic invocation by reference to the named storage only, are discussed. An example is presented which illustrates their efficient implementation and their utility for separating the activities of data structure programming and algorithmic programming.
References
[1]
Wulf, W. A., Russell, D., Habermann, A. N., Geschke, C., Apperson, J., and Wile, D., Bliss Reference Manual, Department of Computer Science document, Carnegie-Mellon University, Pittsburgh, Pa., 1970.
[2]
Digital Equipment Corporation, PDP-10 Reference Handbook, 1969.
[3]
Naur, P. (Ed.), "Revised Report on the Algorithmic Language ALGOL 60", CACM 6, No. 1, (1963), pp. 1--17.
[4]
McCarthy, John, et. al., LISP 1.5 Programmer's Manual, M.I.T. Press, Cambridge, 1962.
- Efficient data accessing in the programming language Bliss
Recommendations
Experiences with a simple structured programming language
SIGCSE '74: Proceedings of the fourth SIGCSE technical symposium on Computer science educationA great deal of interest has developed in structured programming [Dahl, Dijkstra, and Hoare, 1972] during the past few years. This paper is concerned with some experiences obtained in the use of a structured programming language in the computer science ...
Experiences with a simple structured programming language
Proceedings of the 4th SIGCSE symposium on Computer science educationA great deal of interest has developed in structured programming [Dahl, Dijkstra, and Hoare, 1972] during the past few years. This paper is concerned with some experiences obtained in the use of a structured programming language in the computer science ...
Programming language standards
Encyclopedia of Computer ScienceOne of the earliest formal standardization activities undertaken in the field of information technology was for programming languages. This reflects the importance to users of programming languages and the benefits of language standards. There are two ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1971 Copyright is held by the owner/author(s).
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 February 1971
Published in SIGPLAN Volume 6, Issue 2
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 166Total Downloads
- Downloads (Last 12 months)34
- Downloads (Last 6 weeks)3
Reflects downloads up to 01 Mar 2025
Other Metrics
Citations
Cited By
View all- Wile DGeschke C(1972)An implementation base for efficient data structuringInternational Journal of Computer & Information Sciences10.1007/BF009774101:3(209-224)Online publication date: Sep-1972
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in