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.
|Number of pages||12|
|Journal||ACM SIGPLAN Notices|
|Publication status||Published - 2004 Jan|
|Event||Proceedings of the 2004 ACM Sigplan-SIGACT Symposium on Principles of Programming Languages - Venice, Italy|
Duration: 2004 Jan 14 → 2004 Jan 16
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design