Lively linear Lisp
- 1 August 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 27 (8) , 89-98
- https://doi.org/10.1145/142137.142162
Abstract
No abstract availableThis publication has 46 references indexed in Scilit:
- Shallow binding makes functional arrays fastACM SIGPLAN Notices, 1991
- Endpaper: FRPOLY: A benchmark revisitedHigher-Order and Symbolic Computation, 1991
- Some issues and strategies in heap management and memory hierarchiesACM SIGPLAN Notices, 1991
- The linear abstract machineTheoretical Computer Science, 1988
- Values and objects in programming languagesACM SIGPLAN Notices, 1982
- Analysis of pointer “rotation”Communications of the ACM, 1982
- Shallow binding in Lisp 1.5Communications of the ACM, 1978
- Genetic order and compactifying garbage collectorsInformation Processing Letters, 1978
- The one-bit reference countBIT Numerical Mathematics, 1977
- The incremental garbage collection of processesACM SIGPLAN Notices, 1977