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 条
  • [21] Order-sorted term rewriting
    Dick, A.J.J.
    Watson, P.
    Computer Journal, 1991, 34 (01): : 16 - 19
  • [22] ORDER-SORTED TERM REWRITING
    DICK, AJJ
    WATSON, P
    COMPUTER JOURNAL, 1991, 34 (01): : 16 - 19
  • [23] Higher-order rewriting and partial evaluation
    Danvy, O
    Rose, KH
    REWRITING TECHNIQUES AND APPLICATIONS, 1998, 1379 : 286 - 301
  • [24] Infinitary rewriting: meta-theory and convergence
    Kahrs, Stefan
    ACTA INFORMATICA, 2007, 44 (02) : 91 - 121
  • [25] Infinitary rewriting: closure operators, equivalences and models
    Kahrs, Stefan
    ACTA INFORMATICA, 2013, 50 (02) : 123 - 156
  • [26] Applying term rewriting to partial algebra theory
    Dojer, N
    FUNDAMENTA INFORMATICAE, 2004, 63 (04) : 375 - 384
  • [27] Partial inversion of constructor term rewriting systems
    Nishida, N
    Sakai, M
    Sakabe, T
    TERM REWRITING AND APPLICATIONS, PROCEEDINGS, 2005, 3467 : 264 - 278
  • [28] Rewriting Induction for Higher-Order Constrained Term Rewriting Systems
    Hagens, Kasper
    Kop, Cynthia
    LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION, LOPSTR 2024, 2024, 14919 : 202 - 219
  • [29] Partial Order Reduction for Rewriting Semantics of Programming Languages
    Farzan, Azadeh
    Meseguer, Jose
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2007, 176 (04) : 61 - 78
  • [30] PARTIAL ISOMORPHISMS AND INFINITARY LANGUAGES
    CALAIS, JP
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1972, 18 (05): : 435 - 456