Partial Order Infinitary Term Rewriting
From MaRDI portal
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"ohm 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"ohm trees.
Recommendations
- Partial order infinitary term rewriting and Böhm trees
- Partial order reduction for rewriting semantics of programming languages
- Completeness and confluence of order-sorted term rewriting
- Proof Terms for Infinitary Rewriting
- Infinitary rewriting: foundations revisited
- scientific article; zbMATH DE number 1301745
- Processes, Terms and Cycles: Steps on the Road to Infinity
- scientific article; zbMATH DE number 176122
- A termination ordering for higher order rewrite systems
Cited in
(6)- Infinitary rewriting: meta-theory and convergence
- scientific article; zbMATH DE number 7199590 (Why is no real title available?)
- Abstract models of transfinite reductions
- Partial order infinitary term rewriting and Böhm trees
- Bi-rewriting, a term rewriting technique for monotonic order relations
- Convergence in infinitary term graph rewriting systems is simple
This page was built for publication: Partial Order Infinitary Term Rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419490)