We present the first effectively presentable fully abstract model for Stark's Reduced ML, the paradigmatic higher-order programming language combining call-by-value evaluation and 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. This leads to an explicit characterization of program equivalence. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Murawski, A. S., & Tzevelekos, N. (2009). Full abstraction for reduced ml. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5504 LNCS, pp. 32–47). https://doi.org/10.1007/978-3-642-00596-1_4
Mendeley helps you to discover research relevant for your work.