DELAYING UNIFICATION ALGORITHMS FOR LAMBDA-CALCULI

被引：0

作者：

STAPLES, J

机构：

[1] Univ of Queensland, St Lucia,, Queensland, Aust, Univ of Queensland, St Lucia, Queensland, Aust

来源：

THEORETICAL COMPUTER SCIENCE | 1988年 / 56卷 / 03期

关键词：

D O I：

10.1016/0304-3975(88)90135-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：277 / 288

页数：12

共 50 条

[21] Linear realizability and full completeness for typed lambda-calculi
Abramsky, S
Lenisa, M
ANNALS OF PURE AND APPLIED LOGIC, 2005, 134 (2-3) : 122 - 168
[22] Weak and strong beta normalisations in typed lambda-calculi
Xi, HW
TYPED LAMBDA CALCULI AND APPLICATIONS, 1997, 1210 : 390 - 404
[23] REDUCTION AND UNIFICATION IN LAMBDA CALCULI WITH SUBTYPES
NIPKOW, T
QIAN, ZY
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1992, 607 : 66 - 78
[24] Strong normalization from weak normalization in typed lambda-calculi
Sorensen, MH
INFORMATION AND COMPUTATION, 1997, 133 (01) : 35 - 71
[25] COMPARING HAGINO CATEGORICAL PROGRAMMING LANGUAGE AND TYPED LAMBDA-CALCULI
DYBKJAER, H
MELTON, A
THEORETICAL COMPUTER SCIENCE, 1993, 111 (1-2) : 145 - 189
[26] A coinductive approach to proof search through typed lambda-calculi
Santo, Jose Espirito
Matthes, Ralph
Pinto, Luis
ANNALS OF PURE AND APPLIED LOGIC, 2021, 172 (10)
[27] CATEGORICAL ABSTRACT MACHINES FOR HIGHER-ORDER TYPED LAMBDA-CALCULI
RITTER, E
THEORETICAL COMPUTER SCIENCE, 1994, 136 (01) : 125 - 162
[28] Semantic techniques for deriving coinductive characterizations of observational equivalences for lambda-calculi
Lenisa, M
TYPED LAMBDA CALCULI AND APPLICATIONS, 1997, 1210 : 248 - 266
[29] Finite Vector Spaces as Model of Simply-Typed Lambda-Calculi
Valiron, Benoit
Zdancewic, Steve
THEORETICAL ASPECTS OF COMPUTING - ICTAC 2014, 2014, 8687 : 442 - 459
[30] Variations and interpretations of naturality in call-by-name lambda-calculi with generalized applications
Santo, Jose Espirito
Frade, Maria Joao
Pinto, Luis
JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2023, 131

← 1 2 3 4 5 →