| Abstract |
Scheme
is a higher-order, properly tail recursive programming language in which
all values have unlimited extent. Furthermore continuations are values.
These characteristics distinguish Scheme from most other Algol-like languages,
and call for an un-Algol-like approach to storage management in which the
most important compiler optimizations and runtime tricks shift allocation
from the heap to a stack or registers. In this talk I will survey several
of the many different ways to improve the efficiency of storage management
in Scheme and related languages, provide altogether too little data concerning
their effectiveness, and express my opinions on which approaches work the
best. |