Analysis and caching of dependencies

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]  Jean-Jacques Lévy,et al.  An abstract standardisation theorem , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[2]  Joyce L. Vedral,et al.  Functional Programming Languages and Computer Architecture , 1989, Lecture Notes in Computer Science.

[3]  R. Lathe.  Phd by thesis , 1988, Nature.

[4]  Roy Levin,et al.  The Vesta Approach to Precise Configuration of Large Software Systems , 1993 .

[5]  Jan Willem Klop,et al.  Combinatory reduction systems , 1980 .

[6]  Chris Hankin,et al.  Strictness Analysis for Higher-Order Functions , 1986, Sci. Comput. Program..

[7]  Martín Abadi,et al.  Explicit substitutions , 1989, POPL '90.

[8]  Tim Teitelbaum,et al.  Incremental reduction in the lambda calculus , 1990, LISP and Functional Programming.

[9]  John Hughes,et al.  Lazy Memo-functions , 1985, FPCA.

[10]  John Field,et al.  On laziness and optimality in lambda interpreters: tools for specification and analysis , 1989, POPL '90.

[11]  Harold T. Hodes,et al.  The | lambda-Calculus. , 1988 .

[12]  Luc Maranget,et al.  Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems , 1991, POPL '91.

[13]  Michael J. O'Donnell,et al.  Computing in systems described by equations , 1977, Lecture Notes in Computer Science.

[14]  Roy Levin,et al.  The Vesta Language for Configuration Management , 1993 .

[15]  DONALD MICHIE,et al.  “Memo” Functions and Machine Learning , 1968, Nature.

[16]  Gérard Berry,et al.  Stable Models of Typed lambda-Calculi , 1978, ICALP.

[17]  Jr. William Worthington Pugh.  Incremental Computation and the Incremental Evaluation of Functional Programs , 1988 .

[18]  Amitabha Sanyal,et al.  Labeled λ-calculus and a generalised notion of strictness , 1995 .