CONS should not CONS its Arguments, or a Lazy Alloc is a Smart Alloc Export

@article{citeulike:82766, abstract = {Lazy allocation is a model for allocating objects on the execution stack of a high-level language which does not create dangling references. Our model provides safe transportation into the heap for objects that may survive the deallocation of the surrounding stack frame. Space for objects that do not survive the deallocation of the surrounding stack frame is reclaimed without additional effort when the stack is popped. Lazy allocation thus performs a first-level garbage collection, and if the...}, author = {Baker, Henry G.}, citeulike-article-id = {82766}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.4206}, journal = {ACM SIGPLAN Notices}, keywords = {lazy, memory-management}, number = {3}, posted-at = {2006-04-20 19:29:03}, priority = {2}, publisher = {ACM Press}, title = {CONS should not CONS its Arguments, or a Lazy Alloc is a Smart Alloc}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.4206}, volume = {27}, year = {1992} }

TY - JOUR ID - citeulike:82766 L3 - citeulike-article-id:82766 N2 - Lazy allocation is a model for allocating objects on the execution stack of a high-level language which does not create dangling references. Our model provides safe transportation into the heap for objects that may survive the deallocation of the surrounding stack frame. Space for objects that do not survive the deallocation of the surrounding stack frame is reclaimed without additional effort when the stack is popped. Lazy allocation thus performs a first-level garbage collection, and if the... IS - 3 JF - ACM SIGPLAN Notices TI - CONS should not CONS its Arguments, or a Lazy Alloc is a Smart Alloc PB - ACM Press VL - 27 KW - lazy KW - memory-management AU - Baker, Henry PY - 1992/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.4206 ER -