Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic

We present a coinductive framework for defining and reasoning about the infinitary analogues of equational logic and term rewriting in a uniform, coinductive way. The setup captures rewrite sequences of arbitrary ordinal length, but it has neither the need for ordinals nor for metric convergence. This makes the framework especially suitable for formalizations in theorem provers.

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

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

[3]  Jörg Endrullis,et al.  Local Termination: theory and practice , 2010, Log. Methods Comput. Sci..

[4]  Lukasz Czajka,et al.  Coinductive Techniques in Infinitary Lambda-Calculus , 2015, ArXiv.

[5]  Stefan Milius.  Completely iterative algebras and completely iterative monads , 2005, Inf. Comput..

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

[7]  Robert L. Constable,et al.  Infinite Objects in Type Theory , 1986, LICS.

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

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

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

[11]  Alexandra Silva,et al.  A Coinductive Framework for Infinitary Rewriting and Equational Reasoning , 2015, RTA.

[12]  Jan Willem Klop,et al.  Proving Infinitary Normalization , 2009, TYPES.

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

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

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

[16]  Vincent van Oostrom,et al.  Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples , 2014, Log. Methods Comput. Sci..

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

[18]  Lukasz Czajka.  A Coinductive Confluence Proof for Infinitary Lambda-Calculus , 2014, RTA-TLCA.

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

[20]  Jörg Endrullis,et al.  Complexity of Fractran and Productivity , 2009, CADE.

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

[22]  Jan Willem Klop,et al.  Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.

[23]  Hans Zantema.  Normalization of Infinite Terms , 2008, RTA.

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

[25]  R.K. Guy,et al.  On numbers and games , 1978, Proceedings of the IEEE.

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

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

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

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

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

[31]  Jörg Endrullis,et al.  Lazy productivity via termination , 2011, Theor. Comput. Sci..

[32]  Grigore Rosu,et al.  Circular coinductive rewriting , 2000, Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering.

[33]  Hans Zantema,et al.  Proving Productivity in Infinite Data Structures , 2010, RTA.