Polymorphism and Type Inference in Database Programming

ACM Transactions on Database Systems

Volumn 21, Issue 1, 1996, Pages 30-76

  Buneman, Peter ^a   Ohori, Atsushi ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

D.3.1 Programming Languages : Formal Definitions and Theory; D.3.2 Programming Languages : Language Classification applicative languages; D.3.3 Programming Languages : Language Constructs and Features data types and construct, abstract data types

Indexed keywords

DATA PROCESSING; DATA STRUCTURES; OBJECT ORIENTED PROGRAMMING; RELATIONAL DATABASE SYSTEMS;

GENERALIZED RELATIONAL ALGEBRA; INHERITANCE; OBJECT-ORIENTED DATABASES; POLYMORPHISM;

DATABASE SYSTEMS;

EID: 0030103193     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/227604.227609     Document Type: Article

References (72)

1. ATKINSON, M. P., AND BUNEMAN, O. P. 1987. Types and persistence in database programming languages. ACM Comput. Surv. 19, 1, 105-190.
2. ABITEBOUL, S., AND BONNER, A. 1991. Objects and views. In Proceedings of the 1991 ACM SIGMOD Conference. (Denver, Col., May 29-31). ACM, New York, 238-247.
3. ATKINSON, M. P., BAILEY, P. J., CHISHOLM, K. J., COCKSHOTT, W. P., AND MORRISON, R. 1983. An approach to persistent programming. Comput. J. 26, 4 (Nov.), 360-365.
4. ATKINSON, M. P., BANCILHON, F., DEWITT, D., DITTRICK, K., MAIER, D., AND ZDONIK, S. 1989. The object-oriented database system manifesto. In Proceedings of the First Deductive and Object-Oriented Database Conference (Kyoto, Japan, Dec.).
5. ALBANO, A., CARDELLI, L., AND ORSINI, R. 1985. Galileo: A strongly typed, interactive conceptual language. ACM Trans. Database Syst. 10, 2 (June), 230-260.
6. ABADI, M., CARDELLI, L., PIERCE, B., AND PLOTKIN, G. 1991. Dynamic typing in a statically-typed language. ACM Trans. Program Lang. Syst. 13, 2, 237-268.
7. APPEL, A. W., AND MACQUEEN, D. B. 1991. Standard ML of New Jersey. In Proceedings of 3rd International Symposium on Programming Languages and Logic Programming. Springer Verlag, New York, 1-13.
8. AUGUSTSSON, L. 1984. A compiler for lazy ML. In Proceedings of the 1984 ACM Symposium on LISP and Functional Programming (Austin, Tex., Aug. 6-8). ACM, New York, 218-227.
9. BANCILHON, F., BRIGGS, T., KHOSHAFIAN, S., AND VALDURIEZ, P. 1988. FAD, a powerful and simple database language. In Proceedings of the Conference on Very Large Data Bases. 97-105.
10. BISKUP, J. 1981. A formal approach to null values in database relations. In Advances in Data Base Theory, vol. 1. Plenum Press, New York.
11. BUNEMAN, P., JUNG, A., AND OHORI, A. 1991. Using powerdomains to generalize relational databases. Theor. Comput. Sci. 91, 1, 23-56.
12. BUNEMAN, P., LIBKIN, L., SUCIU, D., TANNEN, V., AND WONG, L. 1994. Comprehension syntax. SIGMOD Record, 23, 1 (Mar.), 87-96.
13. BUNEMAN, P., AND OHORI, A. 1991. A type system that reconciles classes and extents. In Proceedings of the 3rd International Workshop on Database Programming Language (Nafplion, Greece, Aug.). Morgan-Kaufmann, San Mateo, Calif. 191-202.
14. BREAZU-TANNEN, V., BUNEMAN, P., AND NAQVI, S. 1991. Structural recursion as a query language. In Proceedings of the 3rd International Workshop on Database Programming Languages (Nafplion, Greece, Aug.). Morgan-Kaufmann, San Mateo, Calif., 9-19.
15. BREAZU-TANNEN, V., BUNEMAN, P., AND WONG, L. 1992. Naturally embedded query languages. In Proceedings of the International Conference on Database Theory (Berlin, Oct.). Lecture Notes in Computer Science, Springer-Verlag, New York, 140-154.
16. BREAZU-TANNEN, V., AND SUBRAHMANYAM, R. 1991. Logical and computational aspects of programming with sets/bags/lists. In Proceedings of the 18th International Colloquium On Automata, Languages, and Programming (Madrid, Spain, July). Lecture Notes in Computer Science, Vol. 510, Springer-Verlag, New York, 60-75.
17. CARDELLI, L. 1986. Amber. In Combinators and Functional Programming, Lecture Notes in Computer Science, Vol. 242. Springer-Verlag, New York, 21-47.
18. CARDELLI, L. 1988. A semantics of multiple inheritance. Inf. Comput. 76, 138-164. (Special issue devoted to Symposium on Semantics of Data Types, Sophia-Antipolis, France, 1984).
19. CARDELLI, L. 1988. A semantics of multiple inheritance. Inf. Comput. 76, 138-164. (Special issue devoted to Symposium on Semantics of Data Types, Sophia-Antipolis, France, 1984).
20. CARDELLI, L., AND MITCHELL, J. 1989. Operations on records. In Proceedings of Mathematical Foundation of Programming Semantics. Lecture Notes in Computer Science, Vol. 442. Springer-Verlag, New York, 22-52.
21. CARDELLI, L., AND WEGNER, P. 1985. On understanding types, data abstraction, and polymorphism. ACM Comput. Surv. 17, 4 (Dec.), 471-522.
22. COPELAND, G., AND MAIER, D. 1984. Making Smalltalk a database system. In Proceedings of the ACM SIGMOD Conference (Boston, Mass., June 18-21). ACM, New York, 316-325.
23. COURCELLE, B. 1983. Fundamental properties of infinite trees. Theor. Comput. Sci. 25, 95-169.
24. DAMAS, L., AND MILNER, R. 1982. Principal type-schemes for functional programs. In Proceedings of the 9th Annual ACM Symposium on Principles of Programming Languages. (Albuquerque, N.M., Jan. 25-27). ACM, New York, 207-212.
25. GALLIER, J., AND SNYDER, W. 1989. Complete sets of transformations for general E-unification. Theor. Comput. Sci. 67, 2, 203-260.
26. HARPER, R., AND PIERCE, B. 1991. A record calculus based on symmetric concatenation. In Proceedings of the 18th Annual ACM Symposium on Principles of Programming Languages. (Orlando, Fla., Jan 21-23). ACM, New York, 131-142.
27. HART, K., AND WONG, L. 1994. Query language for genetic databases. Manuscript available on WWW via http: //www.cis.upenn.edu/~wfan/DBHOME.html.
28. HINDLEY, R. 1969. The principal type-schema of an object in combinatory logic. Trans. AMS 146 (Dec.), 23-60.
29. HOANG, M., MITCHELL, J., AND VISWANATHAN, R. 1993. Standard ML weak polymorphism and imperative constructs. In Proceedings of IEEE Symposium on Logic in Computer Science.
30. HUDAK, P., PEYTON JONES, S., WADLER, P., BOUTEL, B., FAIRBAIRN, J., FASEL, J., GUZMAN, M., HAMMOND, K., HUGHES, J., JOHNSSON, T., KIEBURTZ, D., NIKHIL, R., PARTAIN, W., AND PERTERSON, J. 1992. Report on programming language Haskell, a non-strict, purely functional language, version 1.2. ACM SIGPLAN Not., Haskell Special Issue 27, 5.
31. HUET, G. 1976. Résolution d'équation dans les langages d'ordre 1, 2, . . . ω. Tech. Rep., Univ. Paris, Paris, France.
32. HULL, R., AND KING, R. 1987. Semantic database modeling: Survey, applications and research issues. ACM Comput. Surv. 19, 3, (Sept.).
33. ICHBIAH, J. H., HELIARD, J. G., ROUBINE, O., BARNES, J. G. P., KRIEG-BRUECKNER, B., AND WICHMANN, B. A. 1979. Rationale of the design of the programming language Ada. ACM SIGPLAN Not. 14, 6.
34. IMIELINSKI, T., AND LIPSKI, JR., W. 1984. Incomplete information in relational databases. J. ACM 31, 4 (Oct.), 761-791.
35. IMMERMAN, N., PATNAIK, S., AND STEMPLE, D. 1991. The expressiveness of a family of finite set languages. In Proceedings of the 10th ACM Symposium on Principles of Database Systems (Denver, Col., May 29-31). ACM, New York, 37-52.
36. JATEGAONKAR, L. A., AND MITCHELL, J. C. 1988. ML with extended pattern matching and subtypes. In Proceedings of the ACM Conference on LISP and Functional Programming (Snowbird, Ut., July 25-29). ACM, New York, 198-211.
37. KIM, W. 1994. Observations on the ODMG-93 proposal. ACM SIGMOD Record 23, 1 (Mar.).
38. LEROY, X. 1993. Polymorphism by name for references and continuations. In Proceedings of the 20th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Charleston, S.C., Jan. 10-13). ACM, New York, 220-231.
39. LEROY, X., AND WIES, P. 1991. Polymorphic type inference and assignment. In Proceedings of the 18th Annual ACM Symposium on Principles of Programming Languages (Orlando, Fla., Jan. 21-23). ACM, New York, 291-302.
40. LIPSKI, JR., W. 1979. On semantic issues connected with incomplete information databases. ACM Trans. Database Syst. 4, 3 (Sept.), 262-296.
41. MACQUEEN, D., PLOTKIN, G., AND SETHI, R. 1986. An ideal model for recursive polymorphic types. Inf. Control 71, 95-130.
42. MACQUEEN, D. 1988. References and weak polymorphism. Note in Standard ML of New Jersey Distribution Package.
43. MORRISON, R., BROWN, A. L., CONNOR, R. C. H., AND DEARLE, A. 1989. Napier88 Reference Manual. Tech. Rep., Dept. Computer Science, Univ. St Andrews.
44. MILNER, R. 1978. A theory of type polymorphism in programming. J. Comput. Syst. Sci. 17, 348-375.
45. MILNER, R., TOFTE, M., AND HARPER, R. 1990. The Definition of Standard ML. The MIT Press, Cambridge, Mass.
46. MITCHELL, J. C. 1990. Type systems for programming languages. In Handbook of Theoretical Computer Science. J. van Leeuwen, Ed. MIT Press/Elsevier, Cambridge, Mass./Amsterdam, The Netherlands, ch. 8, 365-458.
47. OBJECT DESIGN, INC. 1991. ObjectStore Reference Manual. Burlington, Mass.
48. OHORI, A. 1989a. A simple semantics for ML polymorphism. In Proceedings of the ACM/IFIP Conference on Functional Programming Languages and Computer Architecture (London, England, Sept.). ACM, New York, 281-292.
49. OHORI, A. 1989b. A study of types, semantics and languages for databases and object-oriented programming. Ph.D. dissertation. Univ. of Pennsylvania.
50. OHORI, A. 1990. Semantics of types for database objects. Theor. Comput. Sci. 76, 53-91.
51. OHORI, A. 1992. A compilation method for ML-style polymorphic record calculi. In Proceedings of the 19th Annual ACM/SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Albuquerque, N.M., Jan. 19-22). ACM, New York, 154-165.
52. OHORI, A., AND BUNEMAN, P. 1988. Type inference in a database programming language. In Proceedings of the 1988 ACM Conference on LISP and Functional Programming (Snowbird, Ut., July 25-27). ACM, New York, pp. 174-183.
53. OHORI, A., AND BUNEMAN, P. 1994. Static type inference for parametric classes. In Theoretical Aspects of Object-Oriented Programming. J. Mitchell and C. Gunter, Eds. MIT Press, Cambridge, Mass., 121-138.
54. OHORI, A., BUNEMAN, P., AND BREAZU-TANNEN, V. 1989. Database programming in Machiavelli: A polymorphic language with static type inference. In Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data (Portland, Ore., May 31-June 2). ACM, New York, 46-57.
55. OHORI, A. 1995. A polymorphic record calculus and its compilation. ACM Trans. Program. Lang. Syst. 17, 6 (Nov.), 844-895.
56. PLOTKIN, G. 1979. Call-by-name, call-by-value, and the λ-calculus. Theor. Comput. Sci. 1, 125-159.
57. REMY, D. 1992. Typing record concatenation for free. In Proceedings of the 19th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Albuquerque, N.M., Jan. 19-22). ACM, New York, 166-175.
58. REMY, D. 1994. Typechecking records and variants in a natural extension of ML. In Theoretical Aspects of Object-Oriented Programming, J. Mitchell and C. Gunter, Eds. MIT Press, Cambridge, Mass., 67-96.
59. ROBINSON, J. A. 1965. A machine-oriented logic based on the resolution principle. J. ACM 12, 1 (Jan.), 23-41.
60. SCHMIDT, J. W. 1977. Some high level language constructs for data of type relation. ACM Trans. Database Syst. 2, 3 (Sept.), 247-261.
61. STROUSTRUP, B. The C++ Programming Language. Addison-Wesley, Reading, Mass.
62. STONEBRAKER, M., AND ROWE, L. 1986. The Design of POSTGRES. In Proceedings of ACM-SIGMOD International Conference on Management of Data (Washington, D.C., May 28-30). ACM, New York, 340-355.
63. TOFTE, M. 1988. Operational semantics and polymorphic type inference. Ph.D. dissertation, Department of Computer Science, Univ. Edinburgh, Edinburgh, Scotland.
64. TURNER, D. A. 1985. Miranda: A non-strict functional language with polymorphic types. In Functional Programming Languages and Computer Architecture. Lecture Notes in Computer Science, Vol. 201. Springer-Verlag, New York, 1-16.
65. WADLER, P. 1991. Comprehending monads. In Proceedings of the ACM Conference on LISP and Functional Programming (Nice, France).
66. WAND, M. 1987. Complete type inference for simple objects. In Proceedings of the 2nd IEEE Symposium on Logic in Computer Science (Ithaca, NY, June). IEEE, New York, 37-44.
67. WAND, M. 1988. Corrigendum: Complete type inference for simple objects. In Proceedings of the 3rd IEEE Symposium on Logic in Computer Science (Edinburgh, Scotland). IEEE, New York, 132.
68. WAND, M. 1989. Type inference for record concatenation and simple objects. In Proceedings of 4th IEEE Symposium on Logic in Computer Science. IEEE, New York, 92-97.
69. WATT, D. A., AND TRINDER, P. 1991. Towards a theory of bulk types. Fide Tech. Rep. 91/26, Glasgow Univ., Glasgow, Scotland.
70. WIRTH, N. 1977. Modula: A language for modular multiprogramming. In Softw. Pract. Exper. 7, 1, 3-35.
71. WONG, L. 1994. Querying nested collections. Ph.D. dissertation. August 1994. Available as IRCS Rep. 94-09. Dept. of Computer and Information Science, Univ. Pennsylvania, Philadelphia.
72. ZANIOLO, C. 1984. Database relations with null values. J. Comput. Syst. Sci. 28, 1, 142-166.