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.
|ジャーナル||Conference Record of the Annual ACM Symposium on Principles of Programming Languages|
|出版ステータス||Published - 2004|
|イベント||Conference Record of POPL 2004 - 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - Venice, Italy|
継続期間: 2004 1 14 → 2004 1 16
ASJC Scopus subject areas