The semi-full closure of Pure Type Systems

被引：0
|
作者：
Barthe, G [1 ]
机构：
[1] Chalmers Tekn Hogskola, Inst Datavetenskap, Gothenburg, Sweden
[2] Univ Minho, Dept Informat, Braga, Portugal
来源：
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1998 | 1998年 / 1450卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show that every functional Pure Type System may be extended to a semi-full Pure Type System. Moreover, the extension is conservative and preserves weak normalization. Based on these results, we give a new, conceptually simple type-checking algorithm for functional Pure Type Systems.
引用
收藏
页码：316 / 325
页数：10
相关论文
共 50 条
12345