Strong normalization in some temporal substructural logics

被引：0

作者：

Kamide, Norihiro ^{[1
]}

机构：

[1] Waseda Univ, Waseda Inst Adv Study, Shinjuku Ku, Tokyo 1698050, Japan

来源：

JOURNAL OF LOGIC AND COMPUTATION | 2013年 / 23卷 / 01期

关键词：

Strong normalization; substructural logic; temporal logic; typed lambda-calculus; CALCULUS;

D O I：

10.1093/logcom/exs002

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Strong normalization theorems are uniformly proved for typed lambda calculi for a family of temporal substructural logics including some temporal non-commutative logics.

引用

页码：1 / 24

页数：24

共 24 条

[1] [Anonymous], 1993, LECT NOTES ARTIFICIA
[2] [Anonymous], 1989, Cambridge Tracts in Theoretical Computer Science
[3] A proof-theoretic investigation of a logic of positions
Baratella, S
Masini, A
[J]. ANNALS OF PURE AND APPLIED LOGIC, 2003, 123 (1-3) : 135 - 162
[4] Benaissa Z.- E.-A., 1999, P WORKSH INT MOD LOG
[5] Natural deduction calculus for linear-time temporal logic
Bolotov, Alexander
Basukoski, Artie
Grigoriev, Oleg
Shangin, Vasilyi
[J]. LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, 4160 : 56 - 68
[6] A temporal-logic approach to binding-time analysis
Davies, R
[J]. 11TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1996, : 184 - 195
[7] A modal analysis of staged computation
Davies, R
Pfenning, F
[J]. JOURNAL OF THE ACM, 2001, 48 (03) : 555 - 604
[8] EXTENDING THE CURRY-HOWARD INTERPRETATION TO LINEAR, RELEVANT AND OTHER RESOURCE LOGICS
GABBAY, DM
DEQUEIROZ, RJGB
[J]. JOURNAL OF SYMBOLIC LOGIC, 1992, 57 (04) : 1319 - 1365
[9] BCK-COMBINATORS AND LINEAR LAMBDA-TERMS HAVE TYPES
HINDLEY, JR
[J]. THEORETICAL COMPUTER SCIENCE, 1989, 64 (01) : 97 - 105
[10] A Labelled Natural Deduction System for Linear Temporal Logic
Andrzej Indrzejczak
[J]. Studia Logica, 2003, 75 (3) : 345 - 376

← 1 2 3 →