The Library
Full abstraction for Reduced ML
Tools
Murawski, Andrzej S. and Tzevelekos, Nikos (2013) Full abstraction for Reduced ML. Annals of Pure and Applied Logic, Volume 164 (Number 11). pp. 1118-1143. doi:10.1016/j.apal.2013.05.007 ISSN 0168-0072.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1016/j.apal.2013.05.007
Abstract
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.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
Journal or Publication Title: | Annals of Pure and Applied Logic | ||||
Publisher: | Elsevier BV | ||||
ISSN: | 0168-0072 | ||||
Official Date: | November 2013 | ||||
Dates: |
|
||||
Volume: | Volume 164 | ||||
Number: | Number 11 | ||||
Page Range: | pp. 1118-1143 | ||||
DOI: | 10.1016/j.apal.2013.05.007 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |