| L. Petersen, R. Harper, K. Crary, and F. Pfenning. A type theory for memory allocation and data layout. In Languages, Jan. 2003. To appear. |
....be better to view all memory as a contiguous segment of words, i.e. a page provided by the operating system, that can be broken up into blocks of desired sizes as needed, and restored when adjacent blocks are freed. This approach is related to that taken in the orderly linear lambda calculus of [21] and the stack logic of [1] however, neither approach addresses general dynamic memory management. The former focuses on a garbage collection architecture in which deallocation is implicit and the latter describes stack allocation and deallocation but not heap deallocation. Yu et al. 34] have ....
Leaf Petersen, Robert Harper, Karl Crary, and Frank Pfenning. A type theory for memory allocation and data layout. In Proc. symposium on Principles of Programming Languages, pages 172-184. ACM Press, 2003.
No context found.
L. Petersen, R. Harper, K. Crary, and F. Pfenning. A type theory for memory allocation and data layout. In Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 172--184. ACM Press, 2003.
No context found.
L. Petersen, R. Harper, K. Crary, and F. Pfenning. A type theory for memory allocation and data layout. In on Principles of programming languages, pages 172--184. ACM Press, 2003.
No context found.
Leaf Petersen, Robert Harper, Karl Crary, and Frank Pfenning. A type theory for memory allocation and data layout. Technical Report CMU-CS-02-171, Department of Computer Science, Carnegie Mellon University, December 2002.
....coercions is definable in this setting. Finally, we have shown how the reserve, alloc, and write primitives can be replaced by typed constants, eliminating the need to incorporate special memory management primitives into the language. The full language is described in a separate technical report [13]. The most important question that we have not yet addressed is how to give an account of the allocation of objects with dynamic extent. The system we have developed so far is predicated on the ability to statically predict the size of an object based on its type. For objects such as arrays ....
Leaf Petersen, Robert Harper, Karl Crary, and Frank Pfenning. A type theory for memory allocation and data layout. Technical Report CMU-CS-02-171, Department of Computer Science, Carnegie Mellon University, December 2002.
No context found.
L. Petersen, R. Harper, K. Crary, and F. Pfenning. A type theory for memory allocation and data layout. In Languages, Jan. 2003. To appear.
No context found.
Petersen, L., R. Harper, K. Crary, and F. Pfenning (2003, January). A Type Theory for Memory Allocation and Data Layout. In Proceedings of the 30th ACM Sigplan Symposium on Principles of Programming Languages (POPL '03), New Orleans, Louisiana, USA, pp. 172--184.
No context found.
L. Petersen, R. Harper, K. Crary, and F. Pfenning. A type theory for memory allocation and data layout. In ACM Symposium on Principles of Programming Languages, Jan. 2003. To appear.
No context found.
L. Petersen, R. Harper, K. Crary, and F. Pfenning. A type theory for memory allocation and data layout. In POPL'03, January 2003.
No context found.
L. Petersen, R. Harper, K. Crary, and F. Pfenning. A type theory for memory allocation and data layout. In ACM Symposium on Principles of Programming Languages, Jan. 2003. To appear.
No context found.
L. Petersen, R. Harper, K. Crary, and F. Pfenning. A type theory for memory allocation and data layout. In symposium on Principles of Programming Languages, 2003.
No context found.
L. Petersen, R. Harper, K. Crary, and F. Pfenning. A type theory for memory allocation and data layout. In Languages, Jan. 2003. To appear.
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