Abstract
The reconstruction of the classic set of subtyping rules for object types, which include rules for recursive types is discussed. The syntactic subtyping rules were constructed to determine when it is safe to substitute one object in place of another, where a different type was possibly expected. It is stated that the object types are recursive where the type signatures of their methods accept or return objects of the same type. It is also stated that the flexible object-oriented notion of type compatibility is based on a safe substitution property. It is stated that a countable number of languages obey both the covariant and contravariant parts of the function subtyping rule.
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.
