Type Inferencing Based on Complete Type Specifications

Type specification completeness is a necessary prerequisite for support of object creating formulae in object calculus leading to formation of new types to be integrated into a type lattice containing the types from which they were formed.

[1]  Michael Stonebraker,et al.  Inclusion of new types in relational data base systems , 1986, 1986 IEEE Second International Conference on Data Engineering.

[2]  Suad Alagic.  F-Bounded Polymorphism for Database Programming Languages , 1994, East/West Database Workshop.

[3]  Jeannette M. Wing,et al.  Specifications and their use in defining subtypes , 1993, OOPSLA '93.

[4]  Andrew T. F. Hutt,et al.  Object analysis and design: description of methods , 1994 .

[5]  Richard Mark Soley,et al.  Object Management Architecture Guide , 1993 .

[6]  Duane Szafron,et al.  The Query Model and Query Language of TIGUKAT , 1993 .

[7]  Michael Z. Spivey,et al.  The Z notation , 1989 .

[8]  Leonid A. Kalinichenko,et al.  Emerging semantic-based interoperable information system technology , 1994 .

[9]  J. Michael Spivey,et al.  The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.

[10]  Vladimir Zadorozhny,et al.  Could the OODB standards be better if more grounded? , 1994, East/West Database Workshop.

[11]  David Jordan,et al.  The Object Database Standard: ODMG 2.0 , 1997 .

[12]  Michele Missikoff,et al.  Correctness of ISA Hierarchies in Object-Oriented Database Schemas , 1994, EDBT.

[13]  G Engels,et al.  Fundamentals of object-oriented languages, systems, and methods : Seminar 9434, August 22-26, 1994 , 1994 .

[14]  Michael Stonebraker,et al.  Readings in Database Systems , 1988 .

[15]  R. G. G. Cattell,et al.  The Object Database Standard: ODMG-93 , 1993 .