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 条
  • [1] PARTIAL ORDER INFINITARY TERM REWRITING AND BOHM TREES
    Bahr, Patrick
    PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON REWRITING TECHNIQUES AND APPLICATIONS (RTA'10), 2010, 6 : 67 - 83
  • [2] On modularity in infinitary term rewriting
    Simonsen, Jakob Grue
    INFORMATION AND COMPUTATION, 2006, 204 (06) : 957 - 988
  • [3] On the modularity of confluence in infinitary term rewriting
    Simonsen, JG
    REWRITING TECHNIQUES AND APPLICATIONS, PROCEEDINGS, 2004, 3091 : 185 - 199
  • [4] Termination and confluence in infinitary term rewriting
    Rodenburg, PH
    JOURNAL OF SYMBOLIC LOGIC, 1998, 63 (04) : 1286 - 1296
  • [5] From Infinitary Term Rewriting to Cyclic Term Graph Rewriting and back
    Bahr, Patrick
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (48): : 2 - 2
  • [6] Convergence in infinitary term graph rewriting systems is simple
    Bahr, Patrick
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2018, 28 (08) : 1363 - 1414
  • [7] UNIQUE NORMAL FORMS IN INFINITARY WEAKLY ORTHOGONAL TERM REWRITING
    Endrullis, Jorg
    Grabmayer, Clemens
    Hendriks, Dimitri
    Klop, Jan Willem
    van Oostrom, Vincent
    PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON REWRITING TECHNIQUES AND APPLICATIONS (RTA'10), 2010, 6 : 85 - 101
  • [8] INFINITARY TERM REWRITING FOR WEAKLY ORTHOGONAL SYSTEMS PROPERTIES AND COUNTEREXAMPLES
    Endrullis, Joerg
    Grabmayer, Clemens
    Hendriks, Dimitri
    Klop, Jan Willem
    van Oostrom, Vincent
    LOGICAL METHODS IN COMPUTER SCIENCE, 2014, 10 (02)
  • [9] COINDUCTIVE FOUNDATIONS OF INFINITARY REWRITING AND INFINITARY EQUATIONAL LOGIC
    Endrullis, Jorg
    Hansen, Helle Hvid
    Hendriks, Dimitri
    Polonsky, Andrew
    Silva, Alexandra
    LOGICAL METHODS IN COMPUTER SCIENCE, 2018, 14 (01)
  • [10] Modularity of Convergence in Infinitary Rewriting
    Kahrs, Stefan
    REWRITING TECHNIQUES AND APPLICATIONS, 2009, 5595 : 179 - 193