Infinitary lambda calculus

被引：85
作者：
Kennaway, JR
Klop, JW
Sleep, MR
deVries, FJ
机构：
[1] UNIV E ANGLIA,SCH INFORMAT SYST,NORWICH NR4 7TJ,NORFOLK,ENGLAND
[2] CWI,DEPT SOFTWARE TECHNOL,NL-1090 GB AMSTERDAM,NETHERLANDS
[3] HITACHI LTD,ADV RES LAB,HATOYAMA,SAITAMA 35003,JAPAN
来源：
THEORETICAL COMPUTER SCIENCE | 1997年 / 175卷 / 01期
基金：
英国工程与自然科学研究理事会;
关键词：
D O I：
10.1016/S0304-3975(96)00171-5
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In a previous paper we have established the theory of transfinite reduction for orthogonal term rewriting systems. In this paper we perform the same task for the lambda calculus. From the viewpoint of infinitary rewriting, the Bohm model of the lambda calculus can be seen as an infinitary term model. In contrast to term rewriting, there are several different possible notions of infinite term, which give rise to different Bohm-like models, which embody different notions of lazy or eager computation.
引用
收藏
页码：93 / 125
页数：33
相关论文
共 8 条
[1]   FULL ABSTRACTION IN THE LAZY LAMBDA-CALCULUS [J].
ABRAMSKY, S ;
ONG, CHL .
INFORMATION AND COMPUTATION, 1993, 105 (02) :159-267
[2]  
BARENDREGT H, 1984, LAMBDA CALCULUS
[3]  
BERADUCCI A, 1996, LOGIC COLLOQUIN 93
[4]  
BERARDUCCI, 1994, IN PRESS SERIES LOGI
[5]  
CURIEN P, 1993, CATEGORICAL COMBINAT
[6]  
KENNAWAY JR, 1995, LECT NOTES COMPUTER, V914, P257
[7]  
KENNAWAY JR, 1992, CS9205 CWI
[8]   TRANSFINITE REDUCTIONS IN ORTHOGONAL TERM REWRITING-SYSTEMS [J].
KENNAWAY, R ;
KLOP, JW ;
SLEEP, R ;
DEVRIES, FJ .
INFORMATION AND COMPUTATION, 1995, 119 (01) :18-38
1