A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A bisimulation for dynamic sealing
2004
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '04
We define λ seal , an untyped call-by-value λ-calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with respect to contextual equivalence. This provides a formal basis for reasoning about data abstraction in open, dynamic settings where static techniques such as type abstraction and logical relations are not applicable.
doi:10.1145/964001.964015
dblp:conf/popl/SumiiP04
fatcat:7lrf7drgfvgypbms66rhkrau6u