This paper presents a framework to reason about the eects of assignments in recursive data structures. We dene an operational semantics for a core language based on Meyer's ideas for a semantics for the object-oriented language Eiel. A series of eld accesses, e.g. f1