Relational reasoning in a nominal semantics for storage (2005)
Cached
Download Links
- [www.research.microsoft.com]
- [research.microsoft.com]
- [research.microsoft.com]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. 7th International Conference on Typed Lambda Calculi and Applications (TLCA), volume 3461 of Lecture Notes in Computer Science |
| Citations: | 46 - 10 self |
BibTeX
@INPROCEEDINGS{Benton05relationalreasoning,
author = {Nick Benton and Benjamin Leperchey},
title = {Relational reasoning in a nominal semantics for storage},
booktitle = {In Proc. 7th International Conference on Typed Lambda Calculi and Applications (TLCA), volume 3461 of Lecture Notes in Computer Science},
year = {2005},
pages = {86--101},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
a higher-order CBV language with recursion and dynamically allocated mutable references that may store both ground data and the addresses of other references, but not functions. This model is adequate, though far from fully abstract. We then develop a relational reasoning principle over the denotational model, and show how it may be used to establish various contextual equivalences involving allocation and encapsulation of store. 1
