Logical Methods in Computer Science (Jan 2018)
Coinductive Foundations of Infinitary Rewriting and Infinitary Equational Logic
Abstract
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.
Keywords