Skip to main content
Article thumbnail
Location of Repository

Subtyping object and recursive types logically? (Extended Abstract)



Abstract. We study subtyping in first-order object calculi with respect to thelogical semantics obtained by identifying terms that satisfy the same set of predicates, as formalized through an assignment system. It is shown that equality inthe full first-order &-calculus is modeled by this notion, which is included in aMorris-style contextual equivalence. 1 Introduction Subtyping is a prominent feature of type-theoretic foundation of object oriented pro-gramming languages. The basic idea is expressed by subsumption: any piece of code of type A can masquerade as a code of type B whenever A is a subtype of B, written A<: B.In typed calculi, equations are stated amongst terms of the same type; when term

Year: 2009
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.