Loading...
Please wait, while we are loading the content...
Similar Documents
Abstract Static and Dynamic Partitioning of Pointers
| Content Provider | CiteSeerX |
|---|---|
| Abstract | Identifying some pointers as invisible threads, for the purposes of storage management, is a generalization from several widely used programming conventions, like threaded trees. The necessary invariant is that nodes that are accessible (without threads) emit threads only to other accessible nodes. Dynamic tagging or static typing of threads ameliorates storage recycling both in functional and imperative languages. We have seen the distinction between threads and links sharpen both hardware- and software-supported storage management in Scheme, and also in C. Certainly, therefore, management and concrete typing, should detect and use this as a new static type. Categories and subject descriptors: D.3.3 [Programming Languages]: Language Constructs and Features data types and structures, dynamic storage management, |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Abstract Static Dynamic Partitioning Accessible Node Concrete Typing Programming Language Necessary Invariant Static Typing Software-supported Storage Management Invisible Thread Programming Convention Thread Ameliorates Storage Subject Descriptor Dynamic Storage Management Dynamic Tagging Language Construct Imperative Language Storage Management New Static Type |
| Content Type | Text |
