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.Comment: arXiv admin note: substantial text overlap with arXiv:1505.01128, arXiv:1306.6224

@article{paperbot439,
  title = {Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic},
  author = {Jörg Endrullis and Helle Hvid Hansen and Dimitri Hendriks and Andrew Polonsky and Alexandra Silva},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 14, Issue 1},
  year = {2018},
  doi = {10.23638/lmcs-14(1:3)2018}
}