Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Analysis and Caching of Dependencies Mart'in Abadi
 

Summary: Analysis and Caching of Dependencies
Mart'in Abadi
Digital Systems Research Center
ma@pa.dec.com
Butler Lampson
Microsoft
blampson@microsoft.com
Jean­Jacques L'evy
INRIA Rocquencourt
Jean­Jacques.Levy@inria.fr
Abstract
We address the problem of dependency analysis and caching
in the context of the –­calculus. The dependencies of a –­
term are (roughly) the parts of the –­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.
1 Introduction
Suppose that we have evaluated the function application
f(1; 2), and that its result is 7. If we cache the equality

  

Source: Abadi, Martín - Department of Computer Science, University of California at Santa Cruz
Lampson, Butler W. - Microsoft Research

 

Collections: Computer Technologies and Information Sciences