Polymorphic type inference for the relational algebra

Journal of Computer and System Sciences

Volumn 64, Issue 3, 2002, Pages 694-718

  Van Bussche, Jan Den ^a   Waller, Emmanuel ^b  

^a HASSELT UNIVERSITY   (Belgium)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; QUERY LANGUAGES; SEMANTICS; SET THEORY; THEOREM PROVING;

CORRECTNESS PROOF; POLYMORPHICALLY NON-REDUNDANT; RELATIONAL DATA MODELS; UNARY OPERATORS;

ALGEBRA;

EID: 10644286578     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1812     Document Type: Conference Paper

References (17)

1. A. V. Aho, R. Sethi, and J. D. Ullman, "Compilers," Addison-Wesley, Reading, MA, 1986.
2. P. Buneman, S. Davidson, M. Fernandez, and D. Suciu, Adding structure to unstructured data, in "Database Theory-ICDT'97" (F. Afrati and Ph. Kolaitis, Eds.), Lecture Notes in Computer Science, Vol. 1186, pp. 336-350, Springer-Verlag, Berlin, 1997.
3. P. Buneman, S. Davidson, G. Hillebrand, and D. Suciu, A query language and optimization techniques for unstructured data, in "Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data," SIGMOD Record 25 (1996), 505-516.
4. H. Garcia-Molina, Y. Papakonstantinou, D. Quass, A. Rajaraman, Y. Sagiv, J. Ullman, V. Vassalos, and J. Widom, The TSIMMIS approach to mediation: Data models and languages, J. Intell. Inform. Systems 8(1997), 117-132.
5. P. Giannini, F. Honsell, and S. Ronchi della Rocca, Type inference: some results, some problems, Fund. Inform., 19 (1993), 87-125.
6. C. A. Gunter and J. C. Mitchell, "Theoretical Aspects of Object-Oriented Programming," MIT Press, Cambridge, MA, 1994.
7. J. R. Hindley, "Basic Simple Type Theory," Cambridge Univ. Press, Cambridge, UK, 1997.
8. J. Melton, "Understanding SQL's Stored Procedures," Morgan Kaufmann, San Mateo, CA, 1998.
9. J. C. Mitchell, "Foundations for Programming Languages," MIT Press, Cambridge, MA, 1996.
10. A. Ohori and P. Buneman, Polymorphism and type inference in database programming, ACM Trans. Database Systems 21 (1996), 30-76.
11. A. Ohori, P. Buneman, and V. Breazu-Tannen, Database programming in Machiavelli - A polymorphic language with static type inference, in "Proceedings of the 1989 ACM SIGMOD International Conference on the Management of Data," SIGMOD Record, 18 (1989), 46-57.
12. D. Rćmy, Type inference for records in a natural extension of ML, in "Theoretical Aspects of Object-Oriented Programming" (G. A. Gunter and J. C. Mitchell, Eds.), pp. 67-96, MIT Press, Cambridge, MA, 1994.
13. D. Rćmy, Typing record concatenation for free, in "Theoretical Aspects of Object-Oriented Programming" (G. A. Gunter and J. C. Mitchell, Eds.), pp. 351-372, MIT Press, Cambridge, MA, 1994.
14. D. Stemple et at., Exceeding the limits of polymorphism in database programming languages, in "Advances in Database Technology-EDBT'90" (F. Bancilhon, C. Thanos, and D. Tsichritzis, Eds.), Lecture Notes in Computer Science, Vol. 416, pp. 269-285, Springer-Verlag, Berlin, 1990.
15. J. Tiuryn, Type inference problems: A survey, in "Mathematical Foundations of Computer Science," (B. Rovan, Ed.), Lecture Notes in Computer Science, Vol. 452, pp. 105-120, 1990.
16. J. D. Ullman, "Elements of ML Programming," Prentice-Hall, Englewood Cliffs, NJ, 1998.
17. S. Vansummeren, An implementation of polymorphic type inference for the relational algebra, written in the programming language ML, Master's thesis, University of Maastricht, 2001.