SAFETY ANALYSIS VERSUS TYPE INFERENCE FOR PARTIAL TYPES

被引：5

作者：

PALSBERG, J

SCHWARTZBACH, MI

机构：

[1] Computer Science Department, Aarhus University, DK-8000 Aarhus C, Ny Munkegade

来源：

INFORMATION PROCESSING LETTERS | 1992年 / 43卷 / 04期

关键词：

FUNCTIONAL PROGRAMMING; ALGORITHMS; SAFETY ANALYSIS; LAMBDA-CALCULUS; PARTIAL TYPES;

D O I：

10.1016/0020-0190(92)90196-3

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Safety analysis is an algorithm for determining if a term in an untyped lambda calculus with constants is safe, i.e., if it does not cause an error during evaluation. We prove that safety analysis accepts strictly more safe lambda terms than does type inference for Thatte's partial types.

引用

页码：175 / 180

页数：6

共 11 条

[1]

BONDORF A, 1990, LECT NOTES COMPUT SC, V432, P70

[2]

JONES ND, 1981, LECTURE NOTES COMPUT, V115, P114

[3]

KOZEN D, 1992, OCT P FOCS 92 S F CO

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

MILNER, R .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1978, 17 (03) :348-375

[5]

OKEEFE PM, 1992, LECT NOTES COMPUT SC, V582, P408

[6]

PALSBERG J, 1992, DAIMI PB389 AARH U C

[7]

SESTOFT P, 1989, 4TH P INT C FUNCT PR, P39

[8]

SHIVERS O, CMUCS91145

[9]

Shivers O., 1991, THESIS CMU

[10]

THATTE S, 1988, LECT NOTES COMPUT SC, V317, P615

← 1 2 →