Analysis and caching of dependencies

  • Authors:
  • Martín Abadi;Butler Lampson;Jean-Jacques Lévy

  • Affiliations:
  • Digital Systems Research Center;Microsoft;INRIA Rocquencourt

  • Venue:
  • Proceedings of the first ACM SIGPLAN international conference on Functional programming
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

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.