Some ideas on data types in high-level languages

ABSTRACT

A number of issues are explored concerning the notion that a data type is a set of values together with a set of primitive operations on those values. Among these are the need for a notation for iterating over the elements of any finite set (instead of the more narrow for i := 1 to n notation), the use of the domain of an array as a data type, the need for a simple notation for allowing types of parameters to be themselves parameters (but in a restrictive fashion), and resulting problems with conversion of values from one type to another.

REFERENCES

• 1: Dahl, O.J., and Hoare, C.A.R. Hierarchical program structures. In Structured Programming, Academic Press, New York, 1972, pp. 175-220.
• 2: Ole-Johan Dahl , Kristen Nygaard, SIMULA: an ALGOL-based simulation language, Communications of the ACM, v.9 n.9, p.671-678, Sept. 1966 [doi>10.1145/365813.365819]
• 3: Ole-Johan Dahl, SIMULA 67 common base language, (Norwegian Computing Center. Publication), 1968
• 4: Alice E. Fischer , Michael J. Fischer, Mode modules as representations of domains: preliminary report, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.139-143, October 01-03, 1973, Boston, Massachusetts [doi>10.1145/512927.512940]
• 5: Gehani, N. Ph.D. Th., Cornell U., Ithaca, N.Y., Aug. 1975.
• 6: John Guttag, Abstract data types and the development of data structures, Proceedings of the 1976 conference on Data : Abstraction, definition and structure, p.72, March 22-24, 1976, Salt Lake City, Utah, United States
• 7: Hoare, C.A.R. A note on the for statement. BIT 12 (1972), 334-341.
• 8: C. A. R. Hoare, Hints on programming language design., Stanford University, Stanford, CA, 1973
• 9: Kathleen Jensen , Niklaus Wirth, Pascal-User Manual and Report, Springer-Verlag New York, Inc., Secaucus, NJ, 1975
• 10: Lampson, B.W., et al. Report on the programming language EUCLID. Xerox Res. Ctr., Palo Alto, Calif., Aug. 1976.
• 11: Barbara Liskov , Stephen Zilles, Programming with abstract data types, Proceedings of the ACM SIGPLAN symposium on Very high level languages, p.50-59, March 28-29, 1974, Santa Monica, California, United States
• 12: Liskov, B.H. An introduction to CLU computation structures. Group Memo 136, Lab. for Comptr. Sci., M.I.T., Cambridge, Mass., Feb. 1976.
• 13: James H. Morris, Jr., Types are not sets, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.120-124, October 01-03, 1973, Boston, Massachusetts [doi>10.1145/512927.512938]
• 14: Ben Wegbreit, The treatment of data types in EL1, Communications of the ACM, v.17 n.5, p.251-264, May 1974 [doi>10.1145/360980.360992]
• 15: Wirth, N. The programming language Pascal. Acta lnformatica 1 (1971), 35-63.
• 16: Wulf, W.A. ALPHARD: Towards a language to support structured programs. Dept. of Comptr. Sci., Carnegie-Mellon U., Pittsburgh, Pa., April 1974.
• 17: Wulf, W.A., London, R.L., and Shaw, M. Abstraction and verification in ALPHARD: Introduction to language and methodology. ISI/RR-76-46, U. of California, June 1976 (also Carnegie-Mellon tech. report).

INDEX TERMS

Keywords:
data types, generic procedures, programming languages