PARTIAL ORDER INFINITARY TERM REWRITING

被引:3
|
作者
Bahr, Patrick [1 ]
机构
[1] Univ Copenhagen, Dept Comp Sci, DK-2100 Copenhagen, Denmark
关键词
infinitary term rewriting; Bohm trees; partial order; confluence; normalisation; CONFLUENCE;
D O I
10.2168/LMCS-10(2:6)2014
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and show that the metric model of convergence coincides with the partial order model restricted to total terms. Hence, partial order convergence constitutes a conservative extension of metric convergence, which additionally offers a fine-grained distinction between different levels of divergence. In the second part, we focus our investigation on strong convergence of orthogonal systems. The main result is that the gap between the metric model and the partial order model can be bridged by extending the term rewriting system by additional rules. These extensions are the well-known Bohm extensions. Based on this result, we are able to establish that -contrary to the metric setting -orthogonal systems are both infinitarily confluent and infinitarily normalising in the partial order setting. The unique infinitary normal forms that the partial order model admits are Bohm trees.
引用
收藏
页数:52
相关论文
共 50 条
  • [31] Counterexamples in infinitary rewriting with non-fully-extended rules
    Ketema, Jeroen
    INFORMATION PROCESSING LETTERS, 2011, 111 (13) : 642 - 646
  • [32] Currying of order-sorted term rewriting systems
    Kawabe, Y
    Ishii, N
    COMPUTING AND COMBINATORICS, 1995, 959 : 191 - 202
  • [33] Term Graph Rewriting and Parallel Term Rewriting
    Corradini, Andrea
    Drewes, Frank
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (48): : 3 - 18
  • [34] A Rewriting Calculus for Cyclic Higher-order Term Graphs
    Bertolissi, C.
    Baldan, P.
    Cirstea, H.
    Kirchner, C.
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 127 (05) : 21 - 41
  • [35] A rewriting calculus for cyclic higher-order term graphs
    Baldan, Paolo
    Bertolissi, Clara
    Cirstea, Horatiu
    Kirchner, Claude
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2007, 17 (03) : 363 - 406
  • [36] A SELF-APPLICABLE PARTIAL EVALUATOR FOR TERM REWRITING-SYSTEMS
    BONDORF, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 352 : 81 - 95
  • [37] Truth, Partial Logic and Infinitary Proof Systems
    Martin Fischer
    Norbert Gratzl
    Studia Logica, 2018, 106 : 515 - 540
  • [38] TERM REWRITING
    THOMAS, M
    COMPUTER JOURNAL, 1991, 34 (01): : 1 - 1
  • [39] Truth, Partial Logic and Infinitary Proof Systems
    Fischer, Martin
    Gratzl, Norbert
    STUDIA LOGICA, 2018, 106 (03) : 515 - 540
  • [40] A LOGIC PROGRAMMING APPROACH TO IMPLEMENTING HIGHER-ORDER TERM REWRITING
    FELTY, A
    LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1992, 596 : 135 - 161