Analysis of list structures generated by lisp functions
暂无分享,去创建一个
The occurrence of garbage cells generated by pure-lisp like programs is formalized. First, we define some classes of LISP functions which characterize the properties of list structures generated by them. Then using these classes, we formalize the occurrence of garbage cells. We also present some results of analysis for pure-lisp interpreter programs written in LISP.
[1] Jeffrey M. Barth. Shifting garbage collection overhead to compile time , 1977, CACM.
[2] Jacques Cohen,et al. Garbage Collection of Linked Data Structures , 1981, CSUR.