Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic
Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew T. Polonsky, Alexandra Soares da Silva · Logical Methods in Computer Science · 2018
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