2026-07-20T05:13:02Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2645 2024-03-06T10:33:28Z ddc:004 open_access

Partial Order Infinitary Term Rewriting and Böhm Trees Bahr, Patrick Infinitary term rewriting Böhm trees partial order confluence normalisation We investigate an alternative model of infinitary term rewriting. Instead of a metric, a partial order on terms is employed to formalise (strong) convergence. We compare this partial order convergence of orthogonal term rewriting systems to the usual metric convergence of the corresponding B{"o}hm extensions. The B{"o}hm extension of a term rewriting system contains additional rules to equate so-called root-active terms. The core result we present is that reachability w.r.t. partial order convergence coincides with reachability w.r.t. metric convergence in the B{"o}hm extension. This result is used to show that, unlike in the metric model, orthogonal systems are infinitarily confluent and infinitarily normalising in the partial order model. Moreover, we obtain, as in the metric model, a compression lemma. A corollary of this lemma is that reachability w.r.t. partial order convergence is a conservative extension of reachability w.r.t. metric convergence. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Patrick Bahr 2010 Is Part Of LIPIcs, Volume 6, Proceedings of the 21st International Conference on Rewriting Techniques and Applications (2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.RTA.2010.67 urn:nbn:de:0030-drops-26455 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.67 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode