Analysis and Caching of Dependencies
Martin Abadi, Butler Lampson, and Jean-Jacques Levy
Citation: M. Abadi, B. Lampson, and J. Levy. Analysis and caching of dependencies. ACM SigPlan International Conference on Functional Programming, Philadelphia, May 1996, pp 83-91.
Links: Abstract, Postscript, Acrobat. Here is an HTML version created by OCR for the benefit of search engines; it is not meant for human consumption.
Email: email@example.com. This paper is at http://research.microsoft.com.
We address the problem of dependency analysis and caching in the context of the lambda calculus. The dependencies of a lambda-term are (roughly) the parts of the lambda-term that contribute to the result of evaluating it. We introduce a mechanism for keeping track of dependencies, and discuss how to use these dependencies in caching.