Karl Crary and Greg Morrisett. Type structure for low-level programming langauges. In Twenty-Sixth International Colloquium on Automata, Languages, and Programming, volume 1644 of Lecture Notes in Computer Science, pages 40--54, Prague, Czech Republic, July 1999. Springer-Verlag.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....created. Initialization is the process by which values get written into the reserved memory, potentially changing its type. It is important for type safety that either the memory be treated linearly in this stage, or else that the initialization operations be such that they only re ne the type [4]. Allocation is the process by which a section of reserved (and presumably initialized) memory is made as an ordinary object. Di erent memory management systems combine these stages in di erent ways. In the TAL framework [13] reservation and allocation are done atomically, and hence ....

Karl Crary and Greg Morrisett. Type structure for low-level programming langauges. In Twenty-Sixth International Colloquium on Automata, Languages, and Programming, volume 1644 of Lecture Notes in Computer Science, pages 40-54, Prague, Czech Republic, July 1999. Springer-Verlag.

....into module initialization code. 6 Related Work ILX is one attempt to transfer results that have been described again and again in an academic setting across to a real world context. Two areas of recent work are particularly relevant: type systems for low level languages (a good summary is in [6]) and the e#orts to incoporate algebraic language features into Java, e.g. Pizza, NextGen and Bucki and Weck s work on compund types [23, 4, 3] In many ways our work is much closer in spirit to the latter, as we accept an existing language as our starting point and are trying to retrofit ....

K. Crary and G. Morrisett. Type structure for low-level programming langauges. In International Colloquium on Automata, Languages, and Programming, pages 40-- 54. Springer-Verlag, July 1999.

No context found.

Karl Crary and Greg Morrisett. Type structure for low-level programming langauges. In Twenty-Sixth International Colloquium on Automata, Languages, and Programming, volume 1644 of Lecture Notes in Computer Science, pages 40--54, Prague, Czech Republic, July 1999. Springer-Verlag.

....created. Initialization is the process by which values get written into the reserved memory, potentially changing its type. It is important for type safety that either the memory be treated linearly in this stage, or else that the initialization operations be such that they only refine the type [3]. Allocation is the process by which a section of reserved (and presumably initialized) memory is made available as an ordinary unrestricted object. Different memory management systems combine these stages in different ways. For example, in the TAL framework [11] reservation and allocation are ....

Karl Crary and Greg Morrisett. Type structure for low-level programming langauges. In Twenty-Sixth International Colloquium on Automata, Languages, and Programming, volume 1644 of Lecture Notes in Computer Science, pages 40--54, Prague, Czech Republic, July 1999. Springer-Verlag.

....created. Initialization is the process by which values get written into the reserved memory, potentially changing its type. It is important for type safety that either the memory be treated linearly in this stage, or else that the initialization operations be such that they only refine the type [4]. Allocation is the process by which a section of reserved (and presumably initialized) memory is made as an ordinary object. Di#erent memory management systems combine these stages in di#erent ways. In the TAL framework [13] reservation and allocation are done atomically, and hence ....

Karl Crary and Greg Morrisett. Type structure for low-level programming langauges. In Twenty-Sixth International Colloquium on Automata, Languages, and Programming, volume 1644 of Lecture Notes in Computer Science, pages 40--54, Prague, Czech Republic, July 1999. Springer-Verlag.

....created. Initialization is the process by which values get written into the reserved memory, potentially changing its type. It is important for type safety that either the memory be treated linearly in this stage, or else that the initialization operations be such that they only re ne the type [4]. Allocation is the process by which a section of reserved (and presumably initialized) memory is made as an ordinary object. Di erent memory management systems combine these stages in di erent ways. In the TAL framework [13] reservation and allocation are done atomically, and hence ....

Karl Crary and Greg Morrisett. Type structure for low-level programming langauges. In Twenty-Sixth International Colloquium on Automata, Languages, and Programming, volume 1644 of Lecture Notes in Computer Science, pages 40-54, Prague, Czech Republic, July 1999. Springer-Verlag.

....means that initialization is incompatible with our usual rule for memory writes. TAL provided an elegant way to handle this using initialization flags, in which the a newly allocated tuple is essentially stamped with its ultimate type and any initialization must move toward that ultimate type [10]. This addressed the aliasing problem because any aliases could have Although mbox is invariant, it does respect symmetric subtyping (that is, mbox(# ) mbox(# # ) when # # # and # ) so associativity and identity for products can be applied beneath an mbox. 12 add d, o 1 , o 2 ; ....

Karl Crary and Greg Morrisett. Type structure for low-level programming langauges. In Twenty-Sixth International Colloquium on Automata, Languages, and Programming, volume 1644 of Lecture Notes in Computer Science, pages 40--54, Prague, Czech Republic, July 1999. Springer-Verlag.

....means that initialization is incompatible with our usual rule for memory writes. TAL provided an elegant way to handle this using initialization flags, in which the a newly allocated tuple is essentially stamped with its ultimate type and any initialization must move toward that ultimate type [11]. This addressed the aliasing problem because any aliases could have weaker views of a tuple, but not incompatible ones. Moreover, since TAL conflates the mechanisms of pointers and tuples, TAL can track the initialization of a tuple on a field by field basis. Thus, TAL permits the interleaving of ....

Karl Crary and Greg Morrisett. Type structure for low-level programming langauges. In Twenty-Sixth International Colloquium on Automata, Languages, and Programming, volume 1644 of Lecture Notes in Computer Science, pages 40--54, Prague, Czech Republic, July 1999. Springer-Verlag.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC