Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
438668 | Theoretical Computer Science | 2007 | 24 Pages |
Abstract
We define , 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics