Summary
An approach to definition of abstract data classes suggested by J.C. Reynolds is investigated in the context of a PASCAL-like language. The issues of inheritance and parameterization of classes are considered, and new design solutions proposed.
Similar content being viewed by others
References
ACM Conference on Data: Abstraction, definition and structure, Salt Lake City, 1976. SIGPLAN Notices 11, special issue (1976)
Brinch Hansen, P.: The programming language Concurrent Pascal. IEEE Trans. Software Engrg. 1, 199–207 (1975)
Elder, J.: Data representations in high-level programming languages. Queen's University of Belfast, Ph. D. thesis, 1975
Gries, D., Gehani, N.: Some ideas on data types in high-level languages. Dept. of Computer Science, Cornell University, TR-75-244, 1975
Hoare, C.A.R.: Record handling. In: Programming languages (F. Genuys, ed.), pp. 291–347. London: Academic Press 1968
Hoare, C.A.R.: Proof of correctness of data representations. Acta Informat. 1, 271–281 (1972)
Hoare, C.A.R.: Proof of a structured program: the sieve of Eratosthenes. Comput. J. 15, 321–325 (1973)
Lampson, B.W., et al.: Report on the programming language Euclid. SIGPLAN Notices 12, 2 (1977)
Liskov, B.: An introduction to CLU. In: New directions in algorithmic languages 1975 (S.A. Schuman, ed.), pp. 139–156. IRIA, Cahier, 1975
McCarthy, J.: Definition of new data types in ALGOL X. ALGOL Bulletin 18, 45–46 (1964)
Milner, R., Morris, L., Newey, M.: A logic for computable functions with reflexive and polymorphic types. Proving and improving programs, Arc et Senans 1975, pp. 371–394. IRIA, Cahier, 1975
Morris, J.H.: Lambda calculus models of programming languages. M.I.T. MAC-TR-57, 1968
Morris, J.H.: Protection in programming languages. Comm. ACM 16, 1, 15–21 (1973)
Morris, J.H.: Types are not sets. ACM Symposium on Principles of Programming Languages, Boston, pp. 120–124, 1973
Morris, J.H.: Towards more flexible type systems. Colloque sur la programmation. In: Lecture notes in computer science, Vol. 19, pp. 377–384. Berlin-Heidelberg-New York: Springer 1974
Reynolds, J.C.: Towards a theory of type structure. Colloque sur la programmation. In: Lecture notes in computer science, Vol. 19, pp. 408–423. Berlin-Heidelberg-New York: Springer 1974
Reynolds, J.C.: User-defined types and procedural data structures as complementary approaches to data abstraction. In: New directions in algorithmic languages (S. Schuman, ed.),pp. 157–168. IRIA, Cahier, 1975
Tennent, R.D.: Language design methods based on semantic principles. Acta Informat. 8, 97–112 (1977)
Tennent, R.D.: Some troublespots in PASCAL for scope and type checking. Submitted for publication
Wang, A.: Generalized types in high-level programming languages. Institute of Mathematics, University of Oslo, Research Reports in Informatics, no. 1, 1975
Wirth, N.: Algorithms+data structures=programs. Englewood Cliffs, N.J.: Prentice-Hall 1976
Wirth, N.: Modula: a language for modular multiprogramming. Software — Practice and Experience 7, 1, 3–36 (1977)
Wirth, N.: Design and implementation of Modula. Software — Practice and Experience 7, 1, 67–84 (1977)
Wulf, W.A., London, R.L., Shaw, M.: Abstraction and verification in Alphard. In: New directions in algorithmic languages (S. Schuman, ed.), pp. 217–295. IRIA, Cahier, 1975
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tennent, R.D. On a new approach to representation independent data classes. Acta Informatica 8, 315–324 (1977). https://doi.org/10.1007/BF00271340
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00271340