On understanding types, data abstraction, and polymorphism

ACM Computing Surveys (CSUR)

Volumn 17, Issue 4, 1985, Pages 471-523

  Cardelli, Luca ^a   Wegner, Peter ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b BROWN UNIVERSITY   (United States)

Author keywords

Data abstraction; inheritance; objectoriented programming; polymorphism; type checking; type inference

Indexed keywords

COMPUTER METATHEORY;

DATA ABSTRACTION; LAMBDA-CALCULUS; POLYMORPHISM; TYPE;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0022333721     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/6041.6042     Document Type: Article

References (44)

1. Aho, A. V., Sethi, R., and Ullman, J. D. 1985. Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading, Mass.
2. Albano, A., Cardelli, L., and Orsini, R. 1985. Galileo: A strongly typed, interactive conceptual language. Trans. Database Syst. 10, 2 (June), 230-260.
3. BOOCH, G. 1983. Software Engineering with Ada. Benjamin/Cummings, Menlo Park, Calif.
4. Bruce, K. B., and Meyer, R. 1984. The semantics of second order polymorphic lambda calculus. In Semantics of Data Types. Lecture Notes in Computer Science, vol. 173, G. Kahn, D. B. MacQueen, and G. Plotkin, Eds. Springer-Verlag, New York.
5. Burstall, R., and Lampson, B. 1984. A kernel language for abstract data types and modules. In Semantics of Data Types. Lecture Notes in Computer Science, vol. 173, G. Kahn, D. B. MacQueen, and G. Plotkin, Eds. Springer-Verlag, New York.
6. Burstall, R., MacQueen, D., and Sannella, D. 1980. Hope: An experimental applicative language. In Conference Record of the 1980 LISP Conference (Stanford, Calif., Aug.). ACM, New York, pp. 136-143.
7. Cardelli, L. 1984a. Basic polymorphic typechecking. Computing Science Tech. Rep. 119, AT&T Bell Laboratories, Murray Hill, N.J. Also in Polymorph. Newslett. 2, 1 (Jan.).
8. Cardelli, L. 1984b. A semantics of multiple inheritance. In Semantics of Data Types. Lecture Notes in Computer Science, vol. 173, G. Kahn, D. B. MacQueen, and G. Plotkin, Eds. Springer-Verlag, New York, pp. 51-67.
9. CARDELLI, L. 1985. Amber. In Combinators and Functional Programming Languages, Proceedings of the 13th Summer School of the LITP (Le Val d'Ajol, Vosges, France, May).
10. Coquand, T., and Huet, G. 1985. Constructions: a higher-order proof system for mechanizing mathematics. Tech. Rep. 401, INRIA, Rocquencourt, France (May).
11. Curry, H. B., and Feys, R. 1958. Combinatory Logic. North-Holland Publ., Amsterdam.
12. Damas, L. 1984. Ph.D. dissertation. Dept, of Computer Science, Univ. of Edinburgh, Edinburgh, Scotland.
13. Damas, L., and Milner, R. 1982. Principal type-schemes for functional programs. In Proceedings of the 9th Annual Symposium on Principles of Programming Languages (Albuquerque, N. Mex., Jan. 25-27). ACM, New York, pp. 207-212.
14. Demers, A., and Donahue, J. 1979. Revised report on Russell. TR 79-389, Computer Science Dept., Cornell Univ., Ithaca, N.Y.
15. DoD (U.S. Department of Defense) 1983. Ada reference manual. ANSI/MIS-STD 1815 (Jan.). U.S. Govt. Printing Office.
16. Fairbairn, J. 1982. Ponder and its type system. Tech. Rep. 31, Computer Laboratory, Univ. of Cambridge, Cambridge, England. (Nov.).
17. Girard, J.-Y. 1971. Une extension de l'interpretation de Godel a l'analyse, et son application a ['elimination des coupures dans l'analyse et la theorie des types. In Proceedings of the 2nd Scandinavian Logic Symposium, J. E. Fenstad, Ed. North-Holland Publ., Amsterdam, pp. 63-92.
18. Goldberg, A., and Robson, D. 1983. Smalltalk-80: The Language and Its Implementation. Addison-Wesley, Reading, Mass.
19. Gordon, M., Milner, R., and Wadsworth, C. 1979. Edinburgh LCF. Lecture Notes in Computer Science, vol. 78. Springer-Verlag, New York.
20. Hendler, J., and Wegner, P. 1986. Viewing object-oriented programming as an enhancement of data abstraction methodology. In Proceedings of the Hawaii Conference on System Sciences (Jan.).
21. Hindley, R. 1969. The principal type scheme of an object in combinatory logic. Trans. Am. Math. Soc. 146 (Dec.), 29-60.
22. Hook, J. G. 1984. Understanding Russell: A first attempt. In Semantics of Data Types. Lecture Notes in Computer Science, vol. 173, G. Kahn, D. B. MacQueen, and G. Plotkin, Eds. Springer-Verlag, New York.
23. Liskov, B. H. 1981. CLU Reference Manual. Lecture Notes in Computer Science, vol. 114. Springer-Verlag, New York.
24. MacQueen, D. B. 1984. Modules for standard ML. In Proceedings of the Symposium on LISP and Functional Programming (Austin, Tex., Aug. 6-8). ACM, New York, pp. 198-207.
25. MacQueen, D. B. 1986. Using dependent types to express modular structure. In Proceedings of the 13th Annual Conference on Principles of Programming Languages (St. Petersburg Beach, Fla., Jan. 13-15). ACM, New York, pp. 277-286.
26. MacQueen, D. B., Plotkin, G. D., and Sethi, R. 1984. An ideal model for recursive polymorphic types. In Proceedings of the 11th Annual Symposium on Principles of Programming Languages (Salt Lake City, Utah, Jan 15-18). ACM, New York, pp. 165-174.
27. Martin-Löf, P. 1980. Intuitionistic type theory. Notes of Giovanni Sambin on a series of lectures given in Padova, Univ. of Padova, Italy (June).
28. Matthews, D. C. J. 1985. Poly manual. Tech. Rep. No. 63, Computer Laboratory, Univ. of Cambridge, Cambridge, England.
29. Milner, R. 1978. A theory of type polymorphism in programming. J. Comput. Syst. Sci. 17, 348-375.
30. Milner, R. 1984. A proposal for Standard ML. In Proceedings of the Symposium on LISP and Functional Programming (Austin, Tex., Aug. 6-8). ACM, New York, pp. 184-197.
31. Mitchell, J. C. 1984. Type inference and type containment. In Semantics of Data Types. Lecture Notes in Computer Science, vol. 173, G. Kahn, D. B. MacQueen, and G. Plotkin, Eds. Springer-Verlag, New York, pp. 51-67.
32. Mitchell, J. C., and Plotkin, G. D. 1985. Abstract types have existential type. In Proceedings of the 12th Annual Symposium on Principles of Programming Languages (New Orleans, La., Jan. 14-16). ACM, New York, pp. 37-51.
33. Mitchell, J. C., Maybury, W., and Sweet, R. 1979. Mesa language manual. Rep. CSL-79-3, Xerox Palo Alto Research Center, Palo Alto, Calif. (Apr.).
34. Reynolds, J. C. 1974. Towards a theory of type structure. In Colloquium sur la programmation. Lecture Notes in Computer Science, vol. 19. Springer-Verlag, New York.
35. Reynolds, J. C. 1985. Three approaches to type structure. In Mathematical Foundations of Software Development. Lecture Notes in Computer Science, vol. 185. Springer-Verlag, Berlin, pp. 97-138.
36. Robinson, J. A. 1965. A machine-oriented logic based on the resolution principle. J. ACM 12, 1 (Jan.), 23-49.
37. Schmidt, E. E. 1982. Controlling large software development in a distributed environment. Rep. CSL-82-7, Xerox Palo Alto Research Center, Palo Alto, Calif. (Dec.).
38. Scott, D. S. 1976. Data types as lattices. SIAM J. Comput. 5, 3, 523-587.
39. Solomon, M. 1978. Type definitions with parameters. In Proceedings of the Conference on Principles of Programming Languages (Tucson, Ariz., Jan.). ACM, New York.
40. Strachey, C. 1967. Fundamental concepts in programming languages. Lecture notes for International Summer School in Computer Programming, Copenhagen, Aug.
41. Wegner, P. 1983. On the unification of data and program abstraction in Ada. In Proceedings of the 10th Annual Symposium on Principles of Programming Languages (Austin, Tex., Jan. 2426). ACM, New York, pp. 256-264.
42. Weinreb, D., and Moon, D. 1981. LISP Machine Manual, Chapter 20: Objects, Message-Passing, and Flavors. Symbolics Inc., Cambridge, Mass.
43. Welsh, J., Sneeringer, W. J., and Hoare, C. A. R. 1977. Ambiguities and insecurities in Pascal. Softw. Pract. Exper. (Nov.).
44. Wirth, N. 1983. Programming in Modula-2. Springer-Verlag, New York.