Recursive Object Types in a Logic of Object-Oriented Programs

摘要

This paper formalizes a small object-oriented programing notation. The notation features imperative commands where objects can be shared, and is rich enough to allow subtypes and recursive object types. The syntax, type checking rules, axiomatic semantics, and operational semantics of the notation are given. A soundness theorem showing the consistency between the axiomatic and operational semantics is also given. A simple corollary of the soundness theorem demonstrates the soundness of the type system. Because of the way types, fields, and methods are declared, no extra effort is required to handle recursive object types.