Abstract types have existential type
ACM Transactions on Programming Languages and Systems (TOPLAS)
Towards fully abstract semantics for local variables
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Correctness of data representations in Algol-like languages
A classical mind
Parametricity and local variables
Journal of the ACM (JACM)
Lisp and Symbolic Computation - Special issue on state in programming languages (part I)
ALGOL-like languages (v.2)
Semantics of dynamic variables in Algol-like languages
Semantics of dynamic variables in Algol-like languages
From Algol to polymorphic linear lambda-calculus
Journal of the ACM (JACM)
A contribution to the development of ALGOL
Communications of the ACM
Representation independence, confinement and access control [extended abstract]
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Objects and classes in Algol-like languages
Information and Computation - FOOL V
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
Possible World Semantics for General Storage in Call-By-Value
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
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
Parametricity as a notion of uniformity in reflexive graphs
Parametricity as a notion of uniformity in reflexive graphs
Separation and information hiding
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles 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)
A memetic algorithm for the job-shop with time-lags
Computers and Operations Research
State-dependent representation independence
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Refinement and separation contexts
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
While the semantics of local variables in programming languages is by now well-understood, the semantics of pointer-addressed heap variables is still an outstanding issue. In particular, the commonly assumed relational reasoning principles for data representations have not been validated in a semantic model of heap variables. In this paper, we define a parametricity semantics for a Pascal-like language with pointers and heap variables which gives such reasoning principles. It is found that the correspondences between data representations are not simply relations between states, but more intricate correspondences that also need to keep track of visible locations whose pointers can be stored and leaked.