Meta-rule synthesis from crossed rewrite systems

  • Hélène Kirchner
  • Miki Hermann
Chapter 2 Infinite Terms, Non-Terminating Systems, And Termination
Part of the Lecture Notes in Computer Science book series (LNCS, volume 516)


Infinite sets of rewrite rules may be generated by completion of term rewriting systems. To cope with this problem, detection of divergence and automatic generation of meta-rules from syntactic conditions of divergence are proposed in this paper. We show that in a reasonably large class of divergent systems, equational rewriting is enough to simulate rewriting with meta-rules, but the full power of typed rewriting and conditional rewriting is needed for some divergence problems.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bac87]
    L. Bachmair. Proof methods for equational theories. PhD thesis, University of Illinois, Urbana-Champaign, 1987. Revised version, August 1988.Google Scholar
  2. [BDH86]
    L. Bachmair, N. Dershowitz, and J. Hsiang. Orderings for equational proofs. In Proceedings Symp. Logic in Computer Science, pages 346–357, IEEE, 1986.Google Scholar
  3. [Der87]
    N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3(1 & 2):69–116, 1987.Google Scholar
  4. [DJ89]
    N. Dershowitz and J.-P. Jouannaud. Notations for rewriting. October 1989. Unpublished note.Google Scholar
  5. [DJ90]
    N. Dershowitz and J.-P. Jouannaud. Handbook of Theoretical Computer Science, chapter 15: Rewrite systems. Volume B, North-Holland, 1990. Also as: Research report 478, LRI.Google Scholar
  6. [DP89]
    N. Dershowitz and E. Pinchover. Inductive synthesis of equational programs. 1989. Unpublished article.Google Scholar
  7. [GJM85]
    J.A. Goguen, J.-P. Jouannaud, and J. Meseguer. Operational semantics for order-sorted algebra. In W. Brauer, editor, Proceeding of the 12th International Colloquium on Automata, Languages and Programming, pages 221–231, Springer-Verlag, Nafplion (Greece), 1985. Lecture Notes in Computer Science, volume 194.Google Scholar
  8. [GKK90]
    I. Gnaedig, C. Kirchner, and H. Kirchner. Equational completion in order-sorted algebras. Theoretical Computer Science, 72, 1990.Google Scholar
  9. [GKM83]
    J.V. Guttag, D. Kapur, and D.R. Musser. On proving uniform termination and restricted termination of rewrite systems. SIAM Journal on Computation, 12(1):189–214, February 1983.Google Scholar
  10. [Gra88]
    B. Gramlich. Unification of Term Schemes — Theory and Applications. Technical Report SR-88.18, SEKI, University of Kaiserslautern, RFA, 1988.Google Scholar
  11. [Her88]
    M. Hermann. Vademecum of divergent term rewriting systems. Research report 88-R-082, Centre de Recherche en Informatique de Nancy, 1988. Presented at Term Rewriting Workshop, Bristol (UK).Google Scholar
  12. [Her89]
    M. Hermann. Crossed term rewriting systems. Research report 89-R-003, Centre de Recherche en Informatique de Nancy, 1989.Google Scholar
  13. [Her90]
    M. Hermann. Chain properties of rule closures. Formal Aspects of Computing, 2(3):207–225, 1990.Google Scholar
  14. [Hue81]
    G. Huet. A complete proof of correctness of the Knuth and Bendix completion algorithm. Journal of Computer Systems and Sciences, 23:11–21, 1981.Google Scholar
  15. [JK86]
    J.-P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal of Computing, 15(4):1155–1194, 1986. Preliminary version in Proceedings 11th ACM Symposium on Principles of Programming Languages, Salt Lake City, 1984.Google Scholar
  16. [JT88]
    K.P. Jantke and M. Thomas. Inductive inference for solving divergence in Knuth-Bendix completion. Research report 88/R6, University of Glasgow, Department of Computer Science, Glasgow, UK, September 1988.Google Scholar
  17. [KB70]
    D.E. Knuth and P.B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263–297, Pergamon Press, Oxford, 1970.Google Scholar
  18. [KH90]
    H. Kirchner and M. Hermann. Meta-rule synthesis from crossed rewrite systems. Research report 90-R-143, Centre de Recherche en Informatique de Nancy, 1990.Google Scholar
  19. [Kir89]
    H. Kirchner. Schematization of infinite sets of rewrite rules generated by divergent completion processes. Theoretical Computer Science, 67(2–3):303–332, October 1989.Google Scholar
  20. [KK82]
    C. Kirchner and H. Kirchner. Résolution d'équations dans les algèbres libres et les variétés équationnelles d'algèbres. 1982. Thèse de troisième cycle, Université de Nancy I.Google Scholar
  21. [Lan89]
    S. Lange. Towards a set of inference rules for solving divergence in Knuth-Bendix completion. In K.P. Jantke, editor, Proceedings of the International Workshop on Analogical and Inductive Inference, Reinhardsbrunn Castle (GDR), pages 304–316, Springer-Verlag, October 1989. Lecture Notes in Computer Science (in Artificial Inteligence), volume 397.Google Scholar
  22. [PS81]
    G. Peterson and M. Stickel. Complete sets of reductions for some equational theories. Journal of the Association for Computing Machinery, 28:233–264, 1981.Google Scholar
  23. [Toy87]
    Y. Toyama. Confluent term rewriting systems with membership conditions. In S. Kaplan and J.-P. Jouannaud, editors, Proceedings of the First International Workshop on Conditional Term Rewriting Systems, Orsay (France), pages 228–241, Springer-Verlag, July 1987. Lecture Notes in Computer Science, volume 308.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Hélène Kirchner
    • 1
  • Miki Hermann
    • 1
  1. 1.Crin and Inria-Lorraine Campus ScientifiqueVandœuvre-lès-NancyFrance

Personalised recommendations