On the modularity of confluence in infinitary term rewriting

被引：0

作者：

Simonsen, JG ^{[1
]}

机构：

[1] Univ Copenhagen, Dept Comp Sci, DIKU, DK-2100 Copenhagen O, Denmark

来源：

REWRITING TECHNIQUES AND APPLICATIONS, PROCEEDINGS | 2004年 / 3091卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We show that, unlike the case in finitary term rewriting, confluence is not a modular property of infinitary term rewriting systems, even when these are non-collapsing. We also give a positive result: two sufficient conditions for the modularity of confluence in the infinitary setting.

引用

页码：185 / 199

页数：15

共 15 条

[1]

[Anonymous], 2003, CAMBR TRACTS THEOR C

[2]

Baader F., 1998, Term Rewriting and All That

[3] REWRITE, REWRITE, REWRITE, REWRITE, REWRITE, ... [J].

DERSHOWITZ, N ;

KAPLAN, S ;

PLAISTED, DA .

THEORETICAL COMPUTER SCIENCE, 1991, 83 (01) :71-96

[4]

Dershowitz Nachum, 1990, Handbook of Theoretical Computer Science, P243

[5] Infinitary lambda calculus [J].

Kennaway, JR ;

Klop, JW ;

Sleep, MR ;

deVries, FJ .

THEORETICAL COMPUTER SCIENCE, 1997, 175 (01) :93-125

[6] TRANSFINITE REDUCTIONS IN ORTHOGONAL TERM REWRITING-SYSTEMS [J].

KENNAWAY, R ;

KLOP, JW ;

SLEEP, R ;

DEVRIES, FJ .

INFORMATION AND COMPUTATION, 1995, 119 (01) :18-38

[7]

KENNAWAY R, TERM REWRITING SYSTE, P668

[8]

KENNAWAY R, 1999, J FUNCTIONAL LOGIC P, P1

[9] MODULARITY OF CONFLUENCE - A SIMPLIFIED PROOF [J].

KLOP, JW ;

MIDDELDORP, A ;

TOYAMA, Y ;

DEVRIJER, R .

INFORMATION PROCESSING LETTERS, 1994, 49 (02) :101-109

[10]

Klop JW, 1992, Handbook of Logik in Computer Science, V2, P1

← 1 2 →