Paper: Full Abstraction for First-Order Objects with Recursive Types and Subtyping (at LICS 1998)

Authors: Ramesh Viswanathan

Abstract

We present a new interpretation of typed object-oriented concepts in terms of well-understood, purely procedural concepts, that preserves observational equivalence. More precisely, we give compositional translations of (a) Ob_1μ, an object calculus supporting method invocation and functional method update with first-order object types and recursive types, and (b) Ob_1<:μ, an extension of Ob_1μ with subtyping, that are fully abstract on closed terms. The target of the translations are a first-order λ-calculus with records and recursive types, with and without subtyping. The translation of the calculus with subtyping is subtype-preserving as well

BibTeX

  @InProceedings{Viswanathan-FullAbstractionforF,
    author = 	 {Ramesh Viswanathan},
    title = 	 {Full Abstraction for First-Order Objects with Recursive Types and Subtyping},
    booktitle =  {Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science (LICS 1998)},
    year =	 {1998},
    month =	 {June}, 
    pages =      {380--391},
    location =   {Indianapolis, IN, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }