# A Coinductive Treatment of Infinitary Rewriting

@article{Endrullis2013ACT, title={A Coinductive Treatment of Infinitary Rewriting}, author={J{\"o}rg Endrullis and Helle Hvid Hansen and Dimitri Hendriks and Andrew T. Polonsky and Alexandra Silva}, journal={ArXiv}, year={2013}, volume={abs/1306.6224} }

We introduce a coinductive definition of infinitary term rewriting. The setup is surprisingly simple, and has in contrast to the usual definitions of infinitary rewriting, neither need for ordinals nor for metric convergence. While the idea of a coinductive treatment of infinitary rewriting is not new, all previous approaches were limited to reductions of length at most omega. The approach presented in this paper is the first to capture the full infinitary term rewriting with reductions of… Expand

#### Figures and Topics from this paper

#### 12 Citations

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning

- Computer Science, Mathematics
- RTA
- 2015

A coinductive framework for defining infinitary analogues of equational reasoning and rewriting in a uniform way that has neither the need for ordinals nor for metric convergence, making the framework especially suitable for formalizations in theorem provers. Expand

Coinductive Techniques in Infinitary Lambda-Calculus

- Computer Science, Mathematics
- ArXiv
- 2015

The main aim of this paper is to promote a certain style of doing coinductive proofs, similar to inductive proofs as commonly done by mathematicians. For this purpose we provide a reasonably direct… Expand

Confluence of nearly orthogonal infinitary term rewriting systems

- Mathematics, Computer Science
- RTA
- 2015

We give a relatively simple coinductive proof of confluence, modulo
equivalence of root-active terms, of nearly orthogonal infinitary
term rewriting systems. Nearly orthogonal systems allow certain… Expand

Proof Terms for Infinitary Rewriting

- Mathematics, Computer Science
- RTA-TLCA
- 2014

This work uses proof terms to define equivalence of transfinite reductions on the basis of permutation equations, and presents a proof of the compression property via proof terms, which establishes permutation equivalence between the original and the compressed reductions. Expand

Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples

- Mathematics, Computer Science
- Log. Methods Comput. Sci.
- 2014

The triangle and diamond properties for infinitary multi-steps (complete developments) in weakly orthogonal TRSs are established, by refining an earlier cluster-analysis for the finite case and establishing the compression lemma. Expand

An Introduction to the Clocked Lambda Calculus

- Computer Science
- ArXiv
- 2014

An extension of the classical λ-calculus with a unary symbol τ used to witness the β-steps with infinitary normal forms are enriched Lévy–Longo Trees, which the authors call clocked LÉvy– longo Trees. Expand

Proof terms for infinitary rewriting, progress report

- Computer Science, Mathematics
- ArXiv
- 2014

The main foundations for this work are the theory of countable ordinals and some deﬁnitions and results which are critical in orderto prove some of the basic properties of inﬂnitary proof terms. Expand

Sound and Complete Equational Reasoning over Comodels

- Computer Science, Mathematics
- MFPS
- 2015

Two sound and complete calculi are given for equational reasoning over comodels: an inductive calculus for equality-on-the-nose, and a coinductive/inductive calculus for Equality modulo bisimulation which captures bisimulations syntactically through non-wellfounded proofs. Expand

Sound and Complete Equational Reasoning over Comodels Dirk Pattinson

- 2015

Comodels of Lawvere theories, i.e. models in Set , model state spaces with algebraic access operations. Standard equational reasoning is known to be sound but incomplete for comodels. We give two… Expand

Finding equations in functional programs

- Computer Science
- 2014

An algorithm finding and proving equations suitable to be used as rewrite rules, which have the potential to simplify a functional program, and putting expressions of this language in a partial order. Expand

#### References

SHOWING 1-10 OF 41 REFERENCES

Infinitary Rewriting Coinductively

- Mathematics, Computer Science
- TYPES
- 2011

We provide a coinductive definition of strongly convergent reductions between infinite lambda terms. This approach avoids the notions of ordinals and metric convergence which have appeared in the… Expand

Highlights in infinitary rewriting and lambda calculus

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2012

The fundamental trichotomy in the semantics of @l-calculus: Bohm trees, Levy-Longo trees, and Berarducci trees is described, along with a short description of a new refinement of Bohm tree semantics, called clocked semantics. Expand

Infinitary Rewriting: Foundations Revisited

- Mathematics, Computer Science
- RTA
- 2010

Several alternatives for the notion of reduction relation and their relationships to these equational theories are being looked at here, as well as several alternatives forThe idea of transfinite reduction itself. Expand

Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting

- Mathematics, Computer Science
- RTA
- 2010

It is shown that the infinitary unique normal form property (UNinf) fails by a simple example of a weakly orthogonal TRS with two collapsing rules, and the compression lemma is refined, indicating that Infinitary confluence, and hence UNinf, holds for weakly hospitalised TRSs that do not contain collapsing rules. Expand

Confluence of the coinductive [lambda]-calculus

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2004

An appropriate notion of reduction is analyzed and proven to be confluent by means of a detailed analysis of the usual Tait/Martin-Lof style development argument, which yields bounds for the lengths of those joining reduction sequences that are guaranteed to exist by confluence. Expand

Infinitary rewriting: closure operators, equivalences and models

- Mathematics, Computer Science
- Acta Informatica
- 2012

This paper unpicking the underlying closure principles used in infinitary rewriting, as well as constructing alternative operators that lead to alternative notions of reduction and equivalence, leads to semantics-based notions of equivalence that tie in with the equivalences constructed from the closure operators. Expand

Proof Terms for Infinitary Rewriting

- Mathematics, Computer Science
- RTA-TLCA
- 2014

This work uses proof terms to define equivalence of transfinite reductions on the basis of permutation equations, and presents a proof of the compression property via proof terms, which establishes permutation equivalence between the original and the compressed reductions. Expand

Abstract Models of Transfinite Reductions

- Mathematics, Computer Science
- RTA
- 2010

An axiomatic model of reductions is introduced that is general enough to cover all of these models of transfinite reductions as well as the ordinary model of finite reductions. Expand

Infinitary Normalization

- Computer Science
- We Will Show Them!
- 2005

This work presents and explains the definitions of these infinitary normalization notions, and establishes that as a global property of orthogonal TRSs they coincide, so at that level there is just one notion of infinite normalization. Expand

Infinitary Term Graph Rewriting is Simple, Sound and Complete

- Mathematics, Computer Science
- RTA
- 2012

Two infinitary calculi of term graph rewriting are developed based on a simple metric and a simple partial order on term graphs and it is argued for the appropriateness of the approach to capture the notion ofinfinitary term graph rewrite. Expand