15-312 Foundations of Programming Languages
Lecture 27: Storage Management

In this lecture we continue our investigation of implementation issues by discussing storage management and garbage collection. We introduce a distinction between small and large values, and store large values on the heap, while small values remain in the stack and the program. The resulting A-machine is strongly bisimilar to the evaluation of the C-machine. It also introduces unreachable heap location, and we show how they can be eliminated by garbage collection.

[ Home | Schedule | Assignments | Software | Resources ]

Frank Pfenning