We present the first effectively presentable fully abstract model for Stark's Reduced ML, a call-by-value higher-order programming language featuring integer-valued references. The model is constructed using techniques of nominal game semantics. Its distinctive feature is the presence of carefully restricted information about the store in plays, combined with conditions concerning the participants' ability to distinguish reference names. We show how it leads to an explicit characterization of program equivalence. © 2013 Elsevier B.V.
Murawski, A. S., & Tzevelekos, N. (2013). Full abstraction for Reduced ML. Annals of Pure and Applied Logic, 164(11), 1118–1143. https://doi.org/10.1016/j.apal.2013.05.007