Skip to main content
SpringerLink
Log in

F-Bounded Polymorphism for Database Programming Languages

  • Conference paper
East/West Database Workshop

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Alagic, Object-Oriented Database Programming, Springer-Verlag, New York, 1989

    Book  Google Scholar 

  2. 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 )

    Google Scholar 

  3. 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)

    Google Scholar 

  4. 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)

    Google Scholar 

  5. 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

    Google Scholar 

  6. 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

    Google Scholar 

  7. 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

    Google Scholar 

  8. 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

    Google Scholar 

  9. 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 )

    Google Scholar 

  10. 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

    Google Scholar 

  11. 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

    Google Scholar 

  12. 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

    Google Scholar 

  13. W. R. Cook, A Proposal for Making Eiffel Type Safe, The Computer Journal Vol. 32, pp. 305–311, 1989

    Article  Google Scholar 

  14. 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 )

    Google Scholar 

  15. 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

    Google Scholar 

  16. C. Lecluse and P. Richard, The 02 Database Programming Language, Proceedings of the 15th International VLDB Conference, pp. 411–422, Morgan-Kaufmann Publishers, 1989

    Google Scholar 

  17. E. G. Manes and M. A. Arbib, Algebraic Approaches to Program Semantics, Springer-Verlag, 1986.

    Google Scholar 

  18. B. Meyer, Eiffel: The Language, Prentice-Hall, 1992.

    MATH  Google Scholar 

  19. 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.

    Google Scholar 

  20. 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 )

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Wichita State University, Wichita, KS, 67260-0083, USA

    Suad Alagić

Authors
  1. Suad Alagić
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Klagenfurt, Universitätsstrasse 65, A-9020, Klagenfurt, Austria

    Johann Eder

  2. Institute for Problems of Informatics, Russian Academy of Sciences, Vavilov Street, 30/6, 117900, Moscow, v-334, Russian Federation

    Leonid A. Kalinichenko

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation