ELIMINATING REDUNDANT RECURSIVE CALLS

被引：32

作者：

COHEN, NH ^{[1
]}

机构：

[1] HARVARD UNIV,CAMBRIDGE,MA 02138

来源：

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS | 1983年 / 5卷 / 03期

关键词：

D O I：

10.1145/2166.2167

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：265 / 299

页数：35

共 18 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] IMPROVING PROGRAMS BY INTRODUCTION OF RECURSION [J].

BIRD, RS .

[3]

BIRD RS, 1980, ACM COMPUT SURV, V12, P403

[4] TRANSFORMATION SYSTEM FOR DEVELOPING RECURSIVE PROGRAMS [J].

BURSTALL, RM ;

DARLINGTON, J .

[5]

Chandra A. K., 1973, 14th Annual Symposium on Switching Automata Theory, P16, DOI 10.1109/SWAT.1973.7

[6]

COHEN NH, 1979, 6TH ANN ACM S PRINC, P143

[7]

COHEN NH, 1980, THESIS HARVARD U CAM

[8] SYSTEM WHICH AUTOMATICALLY IMPROVES PROGRAMS [J].

DARLINGTON, J ;

BURSTALL, RM .

[9]

DARLINGTON J, 1977, 7743 IMP COLL SCI TE

[10]

FRIEDMAN DP, 1976, S SYMB ALG COMP NEW, P85