Inequational Deduction as Term Graph Rewriting

被引：0

|

作者：

Corradini, Andrea ^{[1
]}

Gadducci, Fabio ^{[1
]}

Kahl, Wolfram ^{[2
]}

König, Barbara ^{[3
]}

机构：

[1] Dipartimento di Informatica, Università di Pisa, Italy

[2] Department of Computing and Software, McMaster University, Canada

[3] Institut für Informatik, Technische Universität München, Germany

来源：

Electronic Notes in Theoretical Computer Science | 2007年 / 72卷 / 1 SPEC. ISS.期

关键词：

11;

D O I：

10.1016/j.entcs.2002.09.004

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：31 / 44

相关论文

共 50 条

[21] Theory and applications of term graph rewriting: introduction
Mackie, Ian
Plump, Detlef
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2007, 17 (03) : 361 - 362
[22] Object-oriented term graph rewriting
Papadopoulos, GA
COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 1999, 14 (01): : 39 - 50
[23] Rewriting modulo in deduction modulo
Blanqui, F
REWRITING TECNIQUES AND APPLICATIONS, PROCEEDINGS, 2003, 2706 : 395 - 409
[24] Term-graph rewriting via explicit paths
Balland, Emilie
Moreau, Pierre-Etienne
REWRITING TECHNIQUES AND APPLICATIONS, PROCEEDINGS, 2008, 5117 : 32 - +
[25] REDEX CAPTURING IN TERM GRAPH REWRITING (CONCISE VERSION)
FARMER, WM
WATRO, RJ
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 488 : 13 - 24
[26] DATAFLOW ANALYSIS OF TERM GRAPH REWRITING-SYSTEMS
BANACH, R
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 366 : 55 - 72
[27] Convergence in infinitary term graph rewriting systems is simple
Bahr, Patrick
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2018, 28 (08) : 1363 - 1414
[28] Relating graph and term rewriting via Bohm models
Ariola, Zena M.
Applicable Algebra in Engineering, Communications and Computing, 1996, 7 (05): : 401 - 426
[29] STATIC ANALYSIS OF TERM GRAPH REWRITING-SYSTEMS
HANKIN, C
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 506 : 367 - 384
[30] Relating graph and term rewriting via Bohm models
Ariola, ZM
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 1996, 7 (05) : 401 - 426

← 1 2 3 4 5 →