Projections for infinitary rewriting
Carlos Lombardi, Alejandro R\'ios, Roel de Vrijer

TL;DR
This paper extends proof-term formalism to model projections of infinite rewrite sequences in infinitary term rewriting, providing a precise characterization and illustrating its behavior with examples.
Contribution
It introduces a formal proof-term-based characterization of projections in infinitary rewriting, refining the understanding of structural equivalence and limits in this context.
Findings
Defines a proof-term for infinitary reduction projections
Demonstrates the approach with multiple examples
Shows how limits are incorporated into the projection concept
Abstract
Proof terms in term rewriting are a representation means for reduction sequences, and more in general for contraction activity, allowing to distinguish e.g simultaneous from sequential reduction. Proof terms for finitary, first-order, left-linear term rewriting are described in the Terese book, chapter 8. In a previous work, we defined an extension of the finitary proof-term formalism, that allows to describe contractions in infinitary first-order term rewriting, and gave a characterisation of permutation equivalence. In this work, we discuss how projections of possibly infinite rewrite sequences can be modeled using proof terms. Again, the foundation is a characterisation of projections for finitary rewriting described in Terese, Section 8.7. We extend this characterisation to infinitary rewriting and also refine it, by describing precisely the role that structural equivalence plays…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Logic, Reasoning, and Knowledge · Formal Methods in Verification
