@article{oai:ipsj.ixsq.nii.ac.jp:00059977,
 author = {Kiyoshi, Ono and Masayuki, Suzuki and Eiichi, Goto and Kiyoshi, Ono and Masayuki, Suzuki and Eiichi, Goto},
 issue = {1},
 journal = {Journal of Information Processing},
 month = {Mar},
 note = {Run time garbage collection schemes  such as those used in Lisp  can be aided by a compiler to reclaim more garbage. An additional phase  in a Lisp compiler  for dead access path elimination (by setting dead variables to NIL) together with a strategy for choosing an appropriate order of evaluation (forcing as many variables as possible into becoming dead before allocating new storage space with cons) can increase the amount of reclaimable garbage at run time  thereby reducing the storage space requirement considerably. Experimental results with our Lisp compiler show that the space requirement is reduced to 61% for a polynomial multiplying program  and to 45% for the compiler itself. For a bubble-sort program  the reduction is from 0(n^3) to 0(n)., Run time garbage collection schemes, such as those used in Lisp, can be aided by a compiler to reclaim more garbage. An additional phase, in a Lisp compiler, for dead access path elimination (by setting dead variables to NIL) together with a strategy for choosing an appropriate order of evaluation (forcing as many variables as possible into becoming dead before allocating new storage space with cons) can increase the amount of reclaimable garbage at run time, thereby reducing the storage space requirement considerably. Experimental results with our Lisp compiler show that the space requirement is reduced to 61% for a polynomial multiplying program, and to 45% for the compiler itself. For a bubble-sort program, the reduction is from 0(n^3) to 0(n).},
 pages = {26--34},
 title = {Improvement of Garbage Collection by Aid of Compiler},
 volume = {4},
 year = {1981}
}