Skip to search boxSkip to navigationSkip to main content

Partial Order Infinitary Term Rewriting

  • University of Copenhagen
Research Output:
Journal Article or Conference Article in Journal
Journal article
Peer-review

Open access

Publication Information

Output type

Research Output:
Journal Article or Conference Article in Journal
Journal article
Peer-review

Original language

English

Journal (Volume, Issue Number)

Logical Methods in Computer Science (Volume 10, Issue 2)

Publication milestones

  • Published - 01/06/2014

Publication status

Published - 01/06/2014

ISSN

1860-5974

Publication IDs

  • Scopus: 84902001372

Abstract

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 Böhm 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 Böhm trees.

Publication metrics

PlumX, opens in new tab

Captures
2
Citations
3