Abstract
The relevance of F-bounded polymorphism for database programming languages (object-oriented in particular) is investigated. Two different kinds of object types are proposed as a solution for the controversy between inheritance and subtyping. It is with this duality that complex, recursive object types so typical for database application environments are constructed and the relationship with F-algebras and F-coalgebras hinted in the literature established. Surprisingly enough, the covariant (and thus unsafe) ordering for object types is shown to play an important role in interpreting formally the contravariant (type-safe) subtyping for object types. These results are established in a formal framework based on a variety of kinds (of types) of a polymorphic database type system which serves as a basis for a typed database technology. In addition to the formal theory, application-oriented and database system-oriented illustrations of the usage of F-bounded polymorphism are also presented.
System-oriented implications of this research are made possible by a grant No. 33741MA-RIP from the DOD Defense University Research Instrumentation Program
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Alagic, Object-Oriented Database Programming, Springer-Verlag, New York, 1989
S. Alagic, Toward Multiparadigm Database Interfaces. In: J. W Schmidt and A. A. Stogny (eds), Next Generation of Information Systems Technology, Springer-Verlag, 1991, ( Lecture Notes in Computer Science Vol. 504 )
S. Alagic and R. Sunderraman: Expressibility of Typed Logic Paradigms for Object-Oriented Databases, Proceedings of BNCOD-12, pp. 73–89, Springer-Verlag, 1994 (Lecture Notes in Computer Science Vol. 826)
S. Alagic, R. Sunderraman and R. Bagai: Declarative Object-Oriented Programming: Inheritance, Subtyping and Prototyping, Proceedings of ECOOP ‘84, pp. 236–259, Springer-Verlag, 1994, (Lecture Notes in Computer Science Vol. 821)
A. Albano, L. Cardelli and R. Orsini, Galileo: A Strongly Typed, Interactive Conceptual Language, ACM Transactions on Programming Languages and Systems Vol. 10, pp. 230–260, 1985
A. Albano, G. Ghelli and R. Orsini, Objects for a Database Programming Language, In: P. Kanelakis and J. Schmidt (eds): Proceedings of the Workshop on Database Programming Languages, pp. 236–253, Morgan-Kaufmann Publishers, 1991
K. B. Bruce, Safe Type Checking on a Statically Typed Object-Oriented Programming Language, Proceedings of the ACM Conference on Principles of Programming Languages, pp. 285–298, ACM, 1993
K. Bruce and J. Mitchell, PER Models of Subtyping, Recursive Types and Higher-order Polymorphism, Proceedings of the ACM Conference on Principles of Programming Languages, pp. 316–327, ACM, 1992
L. Cardelli, Types for Data Oriented Languages, In: J.W. Schmidt, S. Ceri and M. Missikoff (eds), Advances in Database Technology - EDBT ‘88, pp. 1–15, Springer-Verlag, Berlin, 1988 ( Lecture Notes in Computer Science Vol. 303 )
L. Cardelli, J. Donahue, M. Jordan, B. Kalslow and G. Nelson, The Modula-3 Type System, In: Conference Record, ACM Symposium on Principles of Programming Languages, pp. 202–212, ACM, 1989
P. Canning, W. Cook, W. Hill, W. Olthoff and J.C. Mitchell, F-Bounded Polymorphism for Object-Oriented Programming, In: Proceedings of the Conference on Functional Programming Languages and Computer Architecture, pp. 273–280, ACM, 1989
W. R. Cook, W. L. Hill and P S Canning, Inheritance Is Not Subtyping, In: Proceedings of the ACM Conference on Principles of Programming Languages, pp. 125–135, ACM, 1990
W. R. Cook, A Proposal for Making Eiffel Type Safe, The Computer Journal Vol. 32, pp. 305–311, 1989
P. Freyd. Algebraically Complete Categories, In: A. Carboni, M.C. Pedicchio and G. Rosolini (Eds): Category Theory: Proceedings of the International Conference (Como), pp. 95–104, Springer-Verlag, 1991, ( Lecture Notes in Mathematics Vol. 1488 )
R. H. Guting, Second-Order Signature: A Tool for Specifying Data Models, Query Processing and Optimization, Proceedings of the ACM SIGMOD Conference, pp. 277–286, ACM, 1993
C. Lecluse and P. Richard, The 02 Database Programming Language, Proceedings of the 15th International VLDB Conference, pp. 411–422, Morgan-Kaufmann Publishers, 1989
E. G. Manes and M. A. Arbib, Algebraic Approaches to Program Semantics, Springer-Verlag, 1986.
B. Meyer, Eiffel: The Language, Prentice-Hall, 1992.
A. Ohori, P. Buneman and V. Breazu-Tannen, Database Programming in Machiavelli - a Polymorphic Language with Static Type Inference, Proceedings of the ACM SIGMOD Conference, pp. 46–57, ACM, 1989.
D. Stemple, L. Fegaras, T. Sheard and A. Socorro, Exceeding the Limits of Polymorphism in Database Programming Languages, In: F. Bancilhon and C. Thanos (Eds), Advances in Database Technology - EDBT ‘80, pp. 269–285, Springer-Verlag, 1990 ( Lecture Notes in Computer Science Vol. 416 )
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alagić, S. (1995). F-Bounded Polymorphism for Database Programming Languages. In: Eder, J., Kalinichenko, L.A. (eds) East/West Database Workshop. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3577-7_9
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3577-7_9
Publisher Name: Springer, London
Print ISBN: 978-3-540-19946-5
Online ISBN: 978-1-4471-3577-7
eBook Packages: Springer Book Archive