A Coinductive Treatment of Infinitary Rewriting

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 arbitrary ordinal length. Apart from an elegant reformulation of known concepts, our approach gives rise, in a very natural way, to a novel notion of infinitary equational reasoning.

[1]  Michael Barr,et al.  Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..

[2]  Patrick Bahr.  Abstract Models of Transfinite Reductions , 2010, RTA.

[3]  H. Barendregt.  The type free lambda calculus , 1977 .

[4]  Jan Willem Klop,et al.  Infinitary Normalization , 2005, We Will Show Them!.

[5]  Patrick Bahr.  Infinitary Term Graph Rewriting is Simple, Sound and Complete , 2012, RTA.

[6]  Stefan Kahrs.  Infinitary rewriting: closure operators, equivalences and models , 2012, Acta Informatica.

[7]  Enno Ohlebusch,et al.  Term Rewriting Systems , 2002 .

[8]  C. Coquand,et al.  On the definition of reduction for infinite terms , 1996 .

[9]  Andrew Polonsky,et al.  Infinitary Rewriting Coinductively , 2011, TYPES.

[10]  Jan Willem Klop,et al.  Highlights in infinitary rewriting and lambda calculus , 2012, Theor. Comput. Sci..

[11]  Patrick Bahr.  Partial Order Infinitary Term Rewriting and Böhm Trees , 2010, RTA.

[12]  Paula Severi,et al.  Infinitary lambda calculus and discrimination of Berarducci trees , 2003, Theor. Comput. Sci..

[13]  Jan Willem Klop,et al.  Transfinite Reductions in Orthogonal Term Rewriting Systems , 1995, Inf. Comput..

[14]  Hendrik Pieter Barendregt,et al.  Applications of infinitary lambda calculus , 2009, Inf. Comput..

[15]  Jakob Grue Simonsen,et al.  On confluence and residuals in Cauchy convergent transfinite rewriting , 2004, Inf. Process. Lett..

[16]  J. R Kennaway.  On transfinite abstract reduction systems , 1992 .

[17]  Felix Joachimski.  Confluence of the coinductive [lambda]-calculus , 2004, Theor. Comput. Sci..

[18]  Paula Severi,et al.  Infinitary Rewriting: From Syntax to Semantics , 2005, Processes, Terms and Cycles.

[19]  Bart Jacobs,et al.  An introduction to (co)algebra and (co)induction , 2011, Advanced Topics in Bisimulation and Coinduction.

[20]  Martin Bodin,et al.  Circular Coinduction in Coq Using Bisimulation-Up-To Techniques , 2013, ITP.

[21]  Alejandro Ríos,et al.  Proof Terms for Infinitary Rewriting , 2014, RTA-TLCA.

[22]  Nachum Dershowitz,et al.  Rewrite, rewrite, rewrite, rewrite, rewrite... , 1989, POPL '89.

[23]  Vincent van Oostrom,et al.  Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting , 2010, RTA.

[24]  Jan Willem Klop,et al.  Infinitary Lambda Calculus , 1997, Theoretical Computer Science.

[25]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

[26]  Stefan Kahrs,et al.  Infinitary Rewriting: Foundations Revisited , 2010, RTA.