Notions of computation and monads
Information and Computation
A functional theory of local names
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantics of dynamic variables in Algol-like languages
Semantics of dynamic variables in Algol-like languages
Revised5 report on the algorithmic language scheme
ACM SIGPLAN Notices
A Stratified Semantics of General References Embeddable in Higher-Order Logic
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Call-by-Push-Value: A Subsuming Paradigm
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Closed Freyd- and kappa-categories
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Notions of Computation Determine Monads
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
A Fully Abstract Domain Model for the p-Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Game Semantics for General References
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
A category-theoretic approach to the semantics of programming languages
A category-theoretic approach to the semantics of programming languages
Correctness of data representations involving heap data structures
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Ownership confinement ensures representation independence for object-oriented programs
Journal of the ACM (JACM)
Denotational semantics for a program logic of objects
Mathematical Structures in Computer Science
Call-by-push-value: Decomposing call-by-value and call-by-name
Higher-Order and Symbolic Computation
Relational parametricity for references and recursive types
Proceedings of the 4th international workshop on Types in language design and implementation
A Formal Language for Cryptographic Pseudocode
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A theory of indirection via approximation
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Monads and Adjunctions for Global Exceptions
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantic foundations for typed assembly languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Correctness of data representations involving heap data structures
ESOP'03 Proceedings of the 12th European conference on Programming
Typing termination in a higher-order concurrent imperative language
Information and Computation
Step-indexed kripke models over recursive worlds
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A typed store-passing translation for general references
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A typed semantics of higher-order store and subtyping
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Database-driven mathematical character recognition
GREC'05 Proceedings of the 6th international conference on Graphics Recognition: ten Years Review and Future Perspectives
Algebraic foundations for effect-dependent optimisations
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Denotational semantics for abadi and leino's logic of objects
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Verifying a secure information flow analyzer
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Relational reasoning in a nominal semantics for storage
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
A semantic foundation for hidden state
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
We describe a simple denotational semantics, using possible worlds, for a call-by-value language with ML-like storage facilities, allowing the storage of values of any type, and the generation of new storage cells. We first present a criticismof traditional Strachey semantics for such a language: that it requires us to specify what happens when we read non-existent cells. We then obtain our model by modifying the Strachey semantics to avoid this problem.We describe our model in 3 stages: first no storage of functions or recursion (but allowing storage of cells), then we add recursion, and finally we allow storage of functions. We discuss similarities and differences between our model and Moggi's model of ground store. A significant difference is that our model does not use monadic decomposition of the function type.