Method schemas

  • Authors:
  • Serge Abiteboul;Paris C. Kanellakis;Emmanuel Waller

  • Affiliations:
  • I.N.R.I.A., 78153 Le Chesnay CEDEX, France;Brown University;I.N.R.I.A., 78153 Le Chesnay CEDEX, France

  • Venue:
  • PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

The concept of method schemas is proposed as a simple model for object-oriented programming with features such as classes with methods and inheritance, method name overloading, and late binding. An important issue is to check whether a given method schema can possibly lead to inconsistencies in some interpretations. The consistency problem for method schemas is studied. The problem is shown to be undecidable in general. Decidability is obtained for monadic and/or recursion-free method schemas. The effect of covariance is considered. The issues of incremental consistency checking and of a sound algorithm for the general case are briefly discussed.