## Compilation and Equivalence of Imperative Objects (1998)

### Cached

### Download Links

- [www.cl.cam.ac.uk]
- [www.cl.cam.ac.uk]
- [ftp.cl.cam.ac.uk]
- [research.microsoft.com]
- [www.cl.cam.ac.uk]
- [www.brics.dk]
- DBLP

### Other Repositories/Bibliography

Citations: | 32 - 4 self |

### BibTeX

@MISC{Gordon98compilationand,

author = {Andrew D. Gordon and Paul D. Hankin and Søren B. Lassen},

title = {Compilation and Equivalence of Imperative Objects},

year = {1998}

}

### Years of Citing Articles

### OpenURL

### Abstract

We adopt the untyped imperative object calculus of Abadi and Cardelli as a minimal setting in which to study problems of compilation and program equivalence that arise when compiling objectoriented languages. We present both a big-step and a small-step substitution-based operational semantics for the calculus. Our rst two results are theorems asserting the equivalence of our substitutionbased semantics with a closure-based semantics like that given by Abadi and Cardelli. Our third result is a direct proof of the correctness of compilation to a stack-based abstract machine via a small-step decompilation algorithm. Our fourth result is that contextual equivalence of objects coincides with a form of Mason and Talcott's CIU equivalence; the latter provides a tractable means of establishing operational equivalences. Finally, we prove correct an algorithm, used in our prototype compiler, for statically resolving method osets. This is the rst study of correctness of an object-oriented abstract machine, and of operational equivalence for the imperative object calculus.