On the expressive power of rewriting
In this paper we address the open problem of classifying the expressive power of classes of rewriting systems. We introduce a framework to reason about the relative expressive power between classes of rewrite system, with respect to every property of interest P. In particular, we investigate four main classes of rewriting systems: left-linear Term Rewriting Systems, Term Rewriting Systems, Normal Conditional Term Rewriting Systems and Join Conditional Term Rewriting Systems. It is proved that, for all the main properties of interest of rewriting systems (completeness, termination, confluence, normalization etc.) these four classes form a hierarchy of increasing expressive power, with two total gaps, between left-linear TRSs and TRSs, and between TRSs and normal CTRSs, and with no gaps between normal CTRSs and join CTRSs. Therefore, these results formally prove the strict increase of expressive power between left-linear and non left-linear term rewriting, and between unconditional and conditional term rewriting, and clarify in what sense normal CTRSs can be seen as equivalent in power to join CTRSs.
KeywordsTerm Rewriting Systems Conditional Term Rewriting Systems Observable Properties Compilers
Unable to display preview. Download preview PDF.
- H. Aida, G. Goguen, and J. Meseguer. Compiling concurrent rewriting onto the rewrite rule machine. In S. Kaplan and M. Okada, editors, Proceedings 2nd International Workshop on Conditional and Typed Rewriting Systems, vol. 516 of LNCS, pp. 320–332. Springer-Verlag, 1990.Google Scholar
- M. Dauchet. Simulation of Turing machines by a left-linear rewrite rule. In N. Dershowitz, editor, Proceedings of the Third International Conference on Rewriting Techniques and Applications, LNCS 355, pages 109–120. Springer-Verlag, 1989.Google Scholar
- M. Dauchet and De Comite. A gap between linear and non-linear termrewriting systems. In Proceedings of the Second International Conference on Rewriting Techniques and Applications, volume 256 of LNCS, pages 95–104, Bordeaux, France. Springer-Verlag, 1987.Google Scholar
- N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6, pages 243–320. Elsevier — MIT Press, 1990.Google Scholar
- N. Dershowitz, M. Okada, and G. Sivakumar. Canonical conditional rewrite systems. In Proceedings of the 9th International Conference on Automated Deduction, volume 310 of LNCS, pages 538–549. Springer-Verlag, 1988.Google Scholar
- E. Giovannetti and C. Moiso. Notes on the elimination of conditions. In S. Kaplan and J.-P. Jouannaud, editors, Proceedings 1st International Workshop on Conditional and Typed Rewriting Systems, volume 308 of LNCS, pages 91–97. Springer-Verlag, 1988.Google Scholar
- C. Hintermeier. How to transform canonical decreasing CTRSs into equivalent canonical TRSs. In N. Dershowitz and N. Lindenstrauss, editors, Proceedings 4th International Workshop on Conditional and Typed Rewriting Systems, vol. 968 of LNCS, pages 186–205. Springer-Verlag, 1995.Google Scholar
- S. Kaplan. A compiler for conditional term rewriting systems. In P. Lescanne, editor, Proceedings 2nd International Conference on Rewriting Techniques and Applications, volume 256 of LNCS, pages 25–41. Springer-Verlag, 1987.Google Scholar
- J.W. Klop. Term rewriting systems. In S. Abramsky, Dov M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, chapter 1, pages 1–116. Clarendon Press, Oxford, 1992.Google Scholar
- M. Marchiori. Unravelings and ultra-properties. In Proceedings of the Fifth International Conference on Algebraic and Logic Programming (ALP'96), volume 1139 of LNCS, pages 107–121. Springer-Verlag, 1996.Google Scholar
- M. Marchiori. The Theory of Vaccines. In Proceedings of the Twenty-fourth International Colloquium on Automata, Languages, and Programming (ICALP'97), volume 1256 of LNCS, pages 660–670, Springer-Verlag, 1997.Google Scholar