Full abstraction for first-order objects with recursive types and subtyping

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