Abstract
We consider a generalization of the concept of abstract data type suitable for modeling situations in which there is more than one level of functionality. An instance of such a situation is the difference in level of functionality between the query and update functions in a data base. We introduce the concept of a higher order data type to model this idea. The underlying algebraic ideas are outlined, and sample applications of the concept are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. A. Goguen, J. W. Thatcher, E. G. Wagner, and J. B. Wright, “Initial Algebra Semantics and Continuous Algebras,”JACM 24(1):68–95 (1977).
J. A. Goguen, J. W. Thatcher, E. G. Wagner, and J. B. Wright, “Abstract Data Types as Initial Algebras and Correctness of Data Representations,”Conference on Computer Graphics, Pattern Recognition, and Data Structures, Los Angeles, California (1975).
J. A. Goguen, J. W. Thatcher, E. G. Wagner, and J. B. Wright, private communication.
R. M. Burstall, “An Algebraic Description of Programs with Assertions, Verification and Simulation,”Proceedings of an ACM Conference on Proving Assertions About Programs, New Mexico (1972).
P. M. Cohn,Universal Algebra (Harper and Row, New York, 1965).
D. Gries, “An illustration of current ideas on the derivation of correctness proofs and correct programs,”IEEE Trans. Software Eng. 2(4) (1976).
J. V. Guttag, “The Specification and Application to Programming of Abstract Data Types,” Ph.D. thesis, University of Toronto (1975).
C. A. R. Hoare, “Notes on Data Structuring,” inStructured Programming (O. J. Dahl, E. W. Dykstra, and C. A. R. Hoare, eds.,) Academic Press, New York, 1972).
C. A. R. Hoare, “An axiomatic basis for computer programming,”Commun. ACM 12:10 (1969).
C. Lucena et al., “On the Use of Very High Level Languages for the Design and Implementation of Reliable Programs,” RJ 1584, IBM Research, (1975).
C. H. Lauterbach et al., “Abstract Data Types inMadcap-vi,” Technical Report, Computer Science Department, University of California, Los Angeles, California (1975).
M. R. Levy, Ph.D. thesis (in preparation), University of Waterloo.
B. Liskov and S. Zilles, “Programming with Abstract Data Types,Proceedings of the SIGPLAN Symposium on Very High Level Languages (1974).
T. S. E. Maibaum, “Mathematical Semantics and a Model for Data Bases,”Proceedings of IFIP Congress '77, Toronto, Ontario, Canada (1977).
T. S. E. Maibaum, “Data bases, data types and semantics,” in preparation.
J. B. Morris et al., “Progress Report on the Languagemadcap-6,” Los Alamos Laboratory, University of California (January 1974).
M. A. Melkanoff et al., “Implementation ofMadcap6 on UCLA's 360/91 IM LAC SYSTEM,” UCLA-ENG-7438, School of Engineering and Applied Science, University of California, Los Angeles, California (1974).
J. T. Schwartz, “Abstract Algorithms and a Set-Theoretic Language for Their Expression,” Computer Science Department, Courant Institute of Mathematical Sciences, New York University (1971).
N. Wirth,Algorithms + Data Structures = Programs (Prentice Hall, Englewood Cliffs, New Jersey, 1976).
S. N. Zilles, “Abstract Specifications for Data Types,” IBM Research Laboratory, San Jose, California (1975).
Author information
Authors and Affiliations
Additional information
This work was partially supported by a research grant from the National Research Council of Canada.
This work was partially supported by the Conselho Nacional de Desenvolvimento Cientifico e Tecnológico (CNPq; Brazil).
Rights and permissions
About this article
Cite this article
Maibaum, T.S.E., Lucena, C.J. Higher order data types. International Journal of Computer and Information Sciences 9, 31–53 (1980). https://doi.org/10.1007/BF00995808
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00995808