Hirokawa, Nao and Middeldorp, Aart and Sternagel, Christian and Winkler, Sarah - Abstract Completion, Formalized

lmcs:4314 - Logical Methods in Computer Science, August 21, 2019, Volume 15, Issue 3
Abstract Completion, Formalized

Authors: Hirokawa, Nao and Middeldorp, Aart and Sternagel, Christian and Winkler, Sarah

Completion is one of the most studied techniques in term rewriting and fundamental to automated reasoning with equalities. In this paper we present new correctness proofs of abstract completion, both for finite and infinite runs. For the special case of ground completion we present a new proof based on random descent. We moreover extend the results to ordered completion, an important extension of completion that aims to produce ground-complete presentations of the initial equations. We present new proofs concerning the completeness of ordered completion for two settings. Moreover, we revisit and extend results of Métivier concerning canonicity of rewrite systems. All proofs presented in the paper have been formalized in Isabelle/HOL.


Source : oai:arXiv.org:1802.08437
Volume: Volume 15, Issue 3
Published on: August 21, 2019
Submitted on: February 26, 2018
Keywords: Computer Science - Logic in Computer Science


Share