Intersection and singleton type assignment characterizing finite Bohm-trees

被引：0
|
作者：
Kurata, T [1 ]
机构：
[1] Tokyo Metropolitan Univ, Dept Math, Hachioji, Tokyo 1920397, Japan
来源：
INFORMATION AND COMPUTATION | 2002年 / 178卷 / 01期
关键词：
D O I：
10.1006/inco.2002.2907
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Intersection types and type constants representing unsolvability and singleton sets of lambda-terms are incorporated into the Curry version of a simple type assignment system. Two restricted forms of typability in the system turn out to be equivalent to finiteness of Bohm-trees. (C) 2002 Elsevier Science (USA).
引用
收藏
页码：1 / 11
页数：11
相关论文
共 39 条
1234