STRICTNESS ANALYSIS FOR HIGHER-ORDER FUNCTIONS

被引：63

作者：

BURN, GL

HANKIN, C

ABRAMSKY, S

机构：

[1] GEC,HIRST RES CTR,WEMBLEY HA9 7PP,MIDDX,ENGLAND

[2] UNIV LONDON IMPERIAL COLL SCI & TECHNOL,DEPT COMP,LONDON SW7 2BZ,ENGLAND

来源：

关键词：

D O I：

10.1016/0167-6423(86)90010-9

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：249 / 278

页数：30

共 14 条

[1]

ABRAMSKY, 1986, LECTURE NOTES COMPUT, V217, P1

[2]

Arbib Michael A., 1975, ARROWS STRUCTURES FU

[3]

CLACK C, 1679 U COLL LOND DEP

[4]

Gierz G., 1980, COMPENDIUM CONTINUOU

[5]

HENNESSY M, 1979, LECTURE NOTES COMPUT, V74, P108

[6] THEORY OF TYPE POLYMORPHISM IN PROGRAMMING [J].

MILNER, R .

[7]

MYCROFT A, 1983, LECT NOTES COMPUT SC, V154, P536

[8]

MYCROFT A, 1981, THESIS U EDINBURGH

[9]

Plotkin G. D., 1976, SIAM Journal on Computing, V5, P452, DOI 10.1137/0205035

[10]

PLOTKIN GD, 1982, LECT NOTES COMPUT SC, V140, P418