A Formal Description Of A Type Checking Algorithm

By: Majid Naeem, Chris Harrison


In object-oriented languages, a subclass enables reuse of the code of its superclass and relies on the type-correctness of the corresponding source code. A particular task associated with statically type checking an object-oriented language is designing the type checking rules which ensure that methods provided in a superclass will continue to be type-correct when inherited in a subclass.

Cite as:

Majid Naeem, Chris Harrison, “A Formal Description Of A Type Checking Algorithm”, Journal of Object Technology, Volume 4, no. 9 (November 2005), pp. 93-100, doi:10.5381/jot.2005.4.9.a2.

PDF | HTML | DOI | BiBTeX | Tweet this | Post to CiteULike | Share on LinkedIn