Abstract
We give a monadic semantics in the category of FM-cpos to 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benton, N., Kennedy, A.: Monads, effects and transformations. In: 3rd International Workshop on Higher Order Operational Techniques in Semantics (HOOTS). Electronic Notes in Theoretical Computer Science, vol. 26. Elsevier, Amsterdam (1999)
Benton, N., Leperchey, B.: Relational reasoning in a nominal semantics for storage. Technical report, Microsoft Research (February 2005)
Levy, P.B.: Possible world semantics for general storage in call-by-value. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, p. 232. Springer, Heidelberg (2002)
Meyer, A.R., Sieber, K.: Towards a fully abstract semantics for local variables: Preliminary report. In: Proceedings of the 15th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) (January 1988)
O’Hearn, P.W., Reynolds, J.C.: From Algol to polymorphic linear lambda-calculus. Journal of the ACM 47(1), 167–223 (2000)
O’Hearn, P.W., Reynolds, J.C., Yang, H.: Local reasoning about programs that alter data structures. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, p. 1. Springer, Heidelberg (2001)
O’Hearn, P.W., Tennent, R.D.: Parametricity and local variables. Journal of the ACM 42(3), 658–709 (1995)
O’Hearn, P.W., Tennent, R.D. (eds.): Progress in Theoretical Computer Science, Algol-like Languages. Birkhäuser, Basel (1997) (Two volumes)
Oles, F.J.: A Category-Theoretic Approach to the Semantics of Programming Languages. PhD thesis, Syracuse University (1982)
Pitts, A.M.: Reasoning about local variables with operationally-based logical relations. In: [8], (1997)
Pitts, A.M., Stark, I.D.B.: Observable properties of higher order functions that dynamically create local names, or: What’s new? In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 122–141. Springer, Heidelberg (1993)
Pitts, A.M., Stark, I.D.B.: Operational reasoning for functions with local state. In: Gordon, A.D., Pitts, A.M. (eds.) Higher Order Operational Techniques in Semantics. Publications of the Newton Institute, pp. 227–273. Cambridge University Press, Cambridge (1998)
Pitts, A.M.: Relational properties of domains. Information and Computation 127(2) (1996)
Reddy, U.S., Yang, H.: Correctness of data representations involving heap data structures. Science of Computer Programming 50(1-3), 129–160 (2004)
Reynolds, J.C.: The essence of Algol. In: Proceedings of the International Symposium on Algorithmic Languages (1981), Reprinted in [8]
Shinwell, M.R.: The Fresh Approach: Functional Programming with Names and Binders. PhD thesis, Computer Laboratory, University of Cambridge (December 2004)
Shinwell, M.R., Pitts, A.M.: On a monadic semantics for freshness. In: Theoretical Computer Science (2005) (To appear)
Sieber, K.: New steps towards full abstraction for local variables. In: Proceedings of the ACM SIGPLAN Workshop on State in Programming Languages (1993)
Stark, I.D.B.: Names and Higher-Order Functions. PhD thesis, Computer Laboratory, University of Cambridge, Available as Technical Report 363 (December 1994)
Sumii, E., Pierce, B.C.: Logical relations for encryption. Journal of Computer Security 11(4) (2003)
Tennent, R.D., Ghica, D.R.: Abstract models of storage. Higher-Order and Symbolic Computation 13(1/2), 119–129 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benton, N., Leperchey, B. (2005). Relational Reasoning in a Nominal Semantics for Storage. In: Urzyczyn, P. (eds) Typed Lambda Calculi and Applications. TLCA 2005. Lecture Notes in Computer Science, vol 3461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11417170_8
Download citation
DOI: https://doi.org/10.1007/11417170_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25593-2
Online ISBN: 978-3-540-32014-2
eBook Packages: Computer ScienceComputer Science (R0)