@INPROCEEDINGS{PittsAM:fulatb,
AUTHOR={E.~Ritter and A.~M.~Pitts},
TITLE={A Fully Abstract Translation between a $\lambda$-Calculus with
Reference Types and {Standard} {M}{L}},
BOOKTITLE={2nd Int. Conf. on Typed Lambda Calculus and Applications,
Edinburgh, 1995},
SERIES={Lecture Notes in Computer Science},
VOLUME={902},
PUBLISHER={Springer-Verlag, Berlin},
YEAR=1995,
PAGES={397--413},
ABSTRACT={This paper describes a syntactic translation for a
substantial fragment of the core Standard ML language into a typed
lambda calculus with recursive types and imperative features in the
form of reference types. The translation compiles SML's use of
declarations and pattern matching into lambda terms, and transforms
the use of environments in the operational semantics into a simpler
relation of evaluation to canonical form. The translation is shown to
be `fully abstract', in the sense that it both preserves and reflects
observational equivalence (also commonly called contextual
equivalence). A co-inductively defined notion of applicative
bisimilarity for lambda calculi with state is developed to establish
this result.}
}