PROVING THEOREMS ABOUT LISP FUNCTIONS

被引：90

作者：

BOYER, RS ^{[1
]}

MOORE, JS ^{[1
]}

机构：

[1] UNIV EDINBURGH,EDINBURGH,SCOTLAND

来源：

关键词：

D O I：

10.1145/321864.321875

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：129 / 144

页数：16

共 27 条

[1] SPLITTING AND REDUCTION HEURISTICS IN AUTOMATIC THEOREM PROVING [J].

BLEDSOE, WW .

[2] COMPUTER PROOFS OF LIMIT THEOREMS [J].

BLEDSOE, WW ;

BOYER, RS ;

HENNEMAN, WH ;

BOYER, RS ;

HENNEMAN, WH .

[3]

BROTZ D, 1973, THESIS STANFORD U

[4] PROVING PROPERTIES OF PROGRAMS BY STRUCTURAL INDUCTION [J].

BURSTALL, RM .

[5]

Cooper D. C., 1971, Machine Intelligence Volume 6, P43

[6]

DARLINGTON J, 1973, P INT JOINT C ARTIF, P479

[7]

ELSPAS B, 1972, 55 I THEOR AUT SCH G

[8]

ELSPAS B, 1973, 1891 STANF RES I FIN

[9]

Floyd Robert W., 1967, P S APPL MATH, V19, P19, DOI DOI 10.1090/PSAPM/019/0235771

[10]

GERHART SL, 1972, THESIS CARNEGIE MELL