Abstract: Abstracting Refinements for Transformation

Rewriting via Coinserters

Neil Ghani
Department of Mathematics and Computer Science, University of Leicester

Christoph Lüth
FB 3 - Mathematik und Informatik, Universität Bremen

This paper introduces a semantics for rewriting that is independent of the data being rewritten and which, nevertheless, models key concepts such as substitution which are central to rewriting algorithms. We demonstrate the naturalness of this construction by showing how it mirrors the usual treatment of algebraic theories as coequalizers of monads. We also demonstrate its naturalness by showing how it captures several canonical forms of rewriting.

Christoph Lüth, 15.01.04