Coinductive foundations of infinitary rewriting and infinitary equational logic

Jörg Endrullis, Helle Hvid Hansen, Dimitri Hendriks, Andrew Polonsky, Alexandra Silva

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

We present a coinductive framework for defining and reasoning about the infinitary analogues of equational logic and term rewriting in a uniform way. We define Equation found, the infinitary extension of a given equational theory =R, and →, the standard notion of infinitary rewriting associated to a reduction relation →R, as follows: (Formula Presented) Equation found Here μ and ν are the least and greatest fixed-point operators, respectively, and (Formula Presented) Equation found 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.

Original languageEnglish
Article number3
Pages (from-to)1-44
Number of pages44
JournalLogical Methods in Computer Science
Volume14
Issue number1
DOIs
Publication statusPublished - 10 Jan 2018

Keywords

  • Coinduction
  • Infinitary equational reasoning
  • Infinitary rewriting

Fingerprint Dive into the research topics of 'Coinductive foundations of infinitary rewriting and infinitary equational logic'. Together they form a unique fingerprint.

Cite this