Further Reading
- Hans-Juergen Boehm.
Garbage collection in an uncooperative environment.
Software: Practice & Experience, 18(9):807–820, September
  1988.
 
- Maurice Bruynooghe.
The memory management of Prolog implementations.
In Keith L. Clark and Sten-Åke Tärnlund, editors, Logic
  Programming, pages 83–98. Academic Press, London, 1982.
 
- D. R. Chase, W. Wegman,
  and F. K. Zadeck.
Analysis of pointers and structures.
ACM SIGPLAN Notices, 25(6):296–319, June 1990.
 
- Thomas W.
  Christopher.
Reference count garbage collection.
Software: Practice & Experience, 14(6):503–507, June 1984.
 
- David Detlefs,
  Al Dosser, and Benjamin Zorn.
Memory allocation costs in large C and C++ programs.
Software: Practice & Experience, 24(6):527–542, June 1994.
 
- Christopher W.
  Fraser and David R. Hanson.
Exploiting machine-specific pointer operations in abstract machines.
Software: Practice & Experience, 12:367–373, 1982.
 
- C. A. R. Hoare.
Recursive data structures.
Technical Report AIM-223 STAN-CS-73-400, Stanford University, Computer Science
  Department, October 1973.
 
- Brian W. Kernighan
  and Dennis M. Ritchie.
The C
  Programming Language.
Prentice-Hall, Englewood Cliffs, NJ, second edition, 1988.
 
- Kai Li and Paul Hudak.
A new list compaction method.
Software: Practice & Experience, 16(2):145–163, February 1986.
 
- Ravi Sethi and Tom
  Stone.
Programming Languages: Concepts and Constructs.
Addison-Wesley, second edition, 1996.
 
- Diomidis Spinellis.
Code Reading: The Open
  Source Perspective, pages 61–93.
Effective Software Development Series. Addison-Wesley, Boston, MA, 2003.
 
- Norihisa Suzuki.
Analysis of pointer ``rotation''.
Communications of the ACM, 25(5):330–335, May 1982.