Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
423050 | Electronic Notes in Theoretical Computer Science | 2006 | 18 Pages |
Abstract
We present a bunched intermediate language for strong (type-changing) update and disposal of first-order references. In contrast to other substructural type systems, the additive constructs of bunched types allow the encapsulation of state that is shared by a collection of procedures.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics