この論文を読む／探す
抄録
LISP 1.9's interpreter execution is fast. One reason is that the revised algorithm for veal and apply decreased the time required for both garbage collections and stack operations. Also, special data representations, such as data area segmentation and the compacted identifier atom header contribute to the speed-up. Last, but not least, is that some coding techniques for push, pop, and cons make the interpreter faster. A short discussion for the LISP interpreter implementation is also presented.
