CPO models for infinite term rewriting

Abstract

Infinite terms in universal algebras are a well-known topic since the seminal work of the ADJ group [1]. The recent interest in the field of term rewriting (tr) for infinite terms is due to the use of term graph rewriting to implement tr, where terms are represented by graphs: so, a cyclic graph is a finitary description of a possibly infinite term. In this paper we introduce infinite rewriting logic, working on the framework of rewriting logic proposed by José Meseguer [13, 14]. We provide a simple algebraic presentation of infinite computations, recovering the infinite parallel term rewriting, originally presented by one of the authors ([6]) to extend the classical,set-theoretical approach to tr with infinite terms. Moreover, we put all the formalism on firm theoretical bases, providing (for the first time, to the best of our knowledge, for infinitary rewriting systems) a clean algebraic semantics by means of (internal) 2-categories.KeywordsComplete DevelopmentDeduction RuleParallel DerivationProof TermModel MorphismThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.