Skip to main content

Rewrite, Rewrite, Rewrite, Rewrite, Rewrite

Nachum Dershowitz, Stéphane Kaplan

DOI 10.1145/75277.75299 dblp BibTeX

Abstract

We study properties of rewrite systems that are not necessarily terminating, but allow instead for transfinite derivations that have a limit.In particular, we give conditions for the existence of a limit and for its uniqueness and relate the operational and algebraic semantics of infinitary theories.We also consider sufficient completeness of hierarchical systems.

Related papers

Composing Source-to-Source Data-Flow Transformations with Rewriting Strategies and Dependent Dynamic Rewrite Rules CC 2005
Within ARM's Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite Systems TOPLAS 1998
On the Adequacy of Graph Rewriting for Simulating Term Rewriting TOPLAS 1994
Rewritable Reference Attributed Grammars ECOOP 2004
Term Graph Rewriting for the pi-Calculus APLAS 2003
Bit-Vector Rewriting with Automatic Rule Generation CAV 2014
Imperative Program Transformation by Rewriting CC 2001
Lazy rewriting on eager machinery TOPLAS 2000