Abstract
We propose a new semi-strong approach to types and static type checking in object-oriented database query and programming languages. Many features of current object-oriented query/programming languages, such as naming, ellipses, automatic coercions and irregularities in data structures, cause that current formal strong type systems are irrelevant to practical situations. There is a need for semi-strong, but still efficient type checking. We treat types as syntactic qualifiers (signatures) attached to objects, procedures, modules and other data/program entities. In our approach a type inference system is based on decision tables involving signatures and producing type checking decisions. A type checker is based on data structures which statically model run-time structures and processes: a metabase, a static environment stack, a static result stack and a type inference decision tables. To discover several type errors in one run we use the mechanism for restoring the state of the type checker after a type error.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
