Analysis and caching of dependencies

被引：12

作者：

Abadi, M

Lampson, B

Levy, JJ

机构：

[1] MICROSOFT CORP,REDMOND,WA 98052

[2] INST NATL RECH INFORMAT & AUTOMAT ROCQUECOURT,LE CHESNAY,FRANCE

来源：

ACM SIGPLAN NOTICES | 1996年 / 31卷 / 06期

关键词：

D O I：

10.1145/232629.232638

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：83 / 91

页数：9

共 18 条

[1]

Abadi M., 1991, Journal of Functional Programming, V1, P375, DOI 10.1017/S0956796800000186

[2]

BARENDREGT H, 1984, LAMBDA CALCULUS

[3]

Berry Gerard, 1978, ICALP SER LECT NOTES, P72, DOI 10.5555/646232.682069

[4] STRICTNESS ANALYSIS FOR HIGHER-ORDER FUNCTIONS [J].

BURN, GL ;

HANKIN, C ;

ABRAMSKY, S .

SCIENCE OF COMPUTER PROGRAMMING, 1986, 7 (03) :249-278

[5]

FIELD J, 1990, PROCEEDINGS OF THE 1990 ACM CONFERENCE ON LISP AND FUNCTIONAL PROGRAMMING, P307, DOI 10.1145/91556.91679

[6]

FIELD J, 1990, P 17 ANN ACM S PRINC, P1

[7]

GANDHE M, 1995, LECT NOTES COMPU DEC

[8]

GONTHIER G, 1992, 7 ANN IEEE S LOG COM

[9]

HANNA CB, 1993, 107 DIG EQ CORP SYST

[10]

HUET G, 1991, COMPUTATIONS ORTHOGO

← 1 2 →