Skip to main content
SpringerLink
Log in
Book cover

International Conference on Rewriting Techniques and Applications

RTA 1993: Rewriting Techniques and Applications pp 468–487Cite as

More problems in rewriting

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 690))

Abstract

Two years ago, in the proceedings of the previous conference, we presented a list of open problems in the theory of rewriting [Dershowitz et al., 1991a]. This time, we report on progress made during the intervening time, and then list some new problems. (A few additional questions on the subject appear in the back of [Diekert, 1990].) We also mention a couple of long-standing open problems which have recently been answered. The last section contains a partisan list of interesting areas for future research. A new, comprehensive survey of the field is [Klop, 1992].

The first author was supported in part by the National Science Foundation under Grants CCR-90-07195 and CCR-90-24271 and by a Meyerhoff Visiting Professorship at the Weizmann Institute of Science; the second author was partially supported by the ESPRIT working groups COMPASS and CCL; the third author's work was partially supported by ESPRIT BRA project 6454: Confer.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aiken and E. Wimmers. Solving systems of set constraints. In Proceedings of the Seventh Symposium on Logic in Computer Science, pages 329–340, Santa Cruz, CA, June 1992. IEEE.

    Google Scholar 

  2. Franz Baader. Rewrite systems for varieties of semigroups. In M. Stickel, editor, Proceedings of the Tenth International Conference on Automated Deduction (Kaiserslautern, West Germany), volume 449 of Lecture Notes in Computer Science, pages 381–395, Berlin, July 1990. Springer-Verlag.

    Google Scholar 

  3. Franz Baader and Klaus Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. In D. Kapur, editor, Proceedings of the Eleventh International Conference on Automated Deduction (Saratoga Springs, NY), volume 607 of Lecture Notes in Artificial Intelligence, Berlin, June 1992. Springer-Verlag.

    Google Scholar 

  4. Franz Baader and Klaus Schulz. Combination techniques and decision problems for disunification. In C. Kirchner, editor, Proceedings of the Fifth International Conference on Rewriting Techniques and Applications (Montreal, Canada), Lecture Notes in Computer Science, Berlin, 1993. Springer-Verlag.

    Google Scholar 

  5. [Bachmair et al., 1993] Leo Bachmair, Harald Ganzinger, and Uwe Waldmann. Set constraints are the monadic class. In Proceedings of the Symposium on Logic in Computer Science (Montreal, Canada). IEEE, 1993.

    Google Scholar 

  6. [Baird et al., 1989] Timothy Baird, Gerald Peterson, and Ralph Wilkerson. Complete sets of reductions modulo Associativity, Commutativity and Identity. In N. Dershowitz, editor, Proceedings of the Third International Conference on Rewriting Techniques and Applications (Chapel Hill, NC), volume 355 of Lecture Notes in Computer Science, pages 29–44, Berlin, April 1989. Springer-Verlag.

    Google Scholar 

  7. Henk P. Barendregt. The Lambda Calculus, its Syntax and Semantics. North-Holland, Amsterdam, second edition, 1984.

    MATH  Google Scholar 

  8. F. Barbanera. Combining term rewriting, and type assignment systems. International J. of Foundations of Computer Science, 1:165–184, 1990.

    MATH  MathSciNet  Google Scholar 

  9. F. Barbanera and M. Fernandez. Modularity of termination and confluence in combinations of rewrite systems with 479-01. In Proceedings of the 20th International Colloquium on Automata, Languages, and Programming, Lund, Sweden, 1993.

    Google Scholar 

  10. F. Barbanera and M. Fernandez. Combining first and higher order rewrite systems with type assignment systems. In Proceedings of the International Conference on Typed Lambda Calculi and Applications, Utrecht, Holland, 1993.

    Google Scholar 

  11. [Barendregt et al., 1987] H. P. Barendregt, M. C. J. D. van Eekelen, J. R. W. Glauert, J. R. Kennaway, M. J. Plasmeijer, and M. R. Sleep. Term graph rewriting. In Proceedings of the European Workshop on Parallel Architectures and Languages, volume 259 of Lecture Notes in Computer Science, pages 141–158, Berlin, 1987. Springer-Verlag.

    Google Scholar 

  12. Ahlem Ben Cherifa and Pierre Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9(2):137–159, October 1987.

    MATH  MathSciNet  Google Scholar 

  13. Alessandro Berarducci and Corrado Böhm. A selfinterpreter of lambda calculus having a normal form. Rapporto tecnico 16, Dip. di Matematica Pura ed Applicata, Universita di L'Aquila, October 1992.

    Google Scholar 

  14. G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217–248, 1992.

    MATH  MathSciNet  Google Scholar 

  15. M. Bezem and J. F. Groote, editors. Proceedings of the International Conference on Typed Lambda Calculi and Applications (Utrecht, The Netherlands), volume 664 of Lecture Notes in Computer Science, Berlin, 1993. Springer-Verlag.

    Google Scholar 

  16. [Bibel et al., 1992] W. Bibel, S. Hölldobler, and J. Würtz. Cycle unification. In D. Kapur, editor, Proceedings of the Eleventh International Conference on Automated Deduction (Saratoga Springs, NY), volume 607 of Lecture Notes in Artificial Intelligence, pages 94–108, Berlin, June 1992. Springer-Verlag.

    Google Scholar 

  17. Alexandre Boudet. Unification in combination of equational theories: An efficient algorithm. In Proceedings of the Tenth International Conference on Automated Deduction (Kaiserslautern, Germany), volume 449 of Lecture Notes in Computer Science. Springer-Verlag, 1990.

    Google Scholar 

  18. Alexandre Boudet. Unification in order-sorted algebras with overloading. In D. Kapur, editor, Proceedings of the Eleventh International Conference on Automated Deduction (Saratoga Springs, NY), volume 607 of Lecture Notes in Artificial Intelligence, Berlin, June 1992. Springer-Verlag.

    Google Scholar 

  19. Alexandre Boudet and Hubert Comon. About the theory of tree embedding. In J.-P. Jouannaud, editor, Proceedings of the Colloquium on Trees in Algebra and Programming (Orsay, France), Lecture Notes in Computer Science, Berlin, April 1993. Springer-Verlag.

    Google Scholar 

  20. Alexandre Boudet and E. Contejean. On n-syntactic equational theories. In H. Kirchner and G. Levi, editors, Proceedings of the Third International Conference on Algebraic and Logic Programming (Pisa, Italy), volume 632 of Lecture Notes in Computer Science, pages 446–457, Berlin, September 1992. Springer-Verlag.

    Google Scholar 

  21. Val Breazu-Tannen and Jean Gallier. Polymorphic rewriting conserves algebraic strong normalization. In Proceedings of the Sixteenth International Colloquium on Automata, Languages and Programming (Stresa, Italy), volume 372 of Lecture Notes in Computer Science, pages 137–150, Berlin, July 1989. European Association of Theoretical Computer Science, Springer-Verlag.

    Google Scholar 

  22. A.-C. Caron. Linear bounded automata and rewrite systems: Influence of initial configurations on decision properties. In Proceedings of the International Joint Conference on Theory and Practice of Software Development, volume 1: Colloquium on Trees in Algebra and Programming (Brighton, U.K.), volume 493 of Lecture Notes in Computer Science, pages 74–89, Berlin, April 1991. Springer-Verlag.

    Google Scholar 

  23. [Caron et al., 1993] A.-C. Caron, J.-L. Coquidé, and M. Dauchet. Encompassment properties and automata with constraints. In C. Kirchner, editor, Proceedings of the Fifth International Conference on Rewriting Techniques and Applications (Montreal, Canada), Lecture Notes in Computer Science, Berlin, 1993. Springer-Verlag.

    Google Scholar 

  24. Paul Chew. Unique normal forms in term rewriting systems with repeated variables. In Proceedings of the Thirteenth Annual Symposium on Theory of Computing, pages 7–18. ACM, 1981.

    Google Scholar 

  25. D. Cohen and P. Watson. An efficient representation of arithmetic for term rewriting. In R. Book, editor, Proceedings of the Fourth International Conference on Rewriting Techniques and Applications (Como, Italy), volume 488 of Lecture Notes in Computer Science, pages 240–251, Berlin, April 1991. Springer-Verlag.

    Google Scholar 

  26. Hubert Comon. de Unification et Disunification: Théorie et Applications. PhD thesis, l'Institut National Polytechnique de Grenoble, 1988.

    Google Scholar 

  27. Hubert Comon. Solving inequations in term algebras (Preliminary version). In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, pages 62–69, Philadelphia, PA, June 1990. IEEE.

    Google Scholar 

  28. Hubert Comon. Completion of Rewrite Systems with Membership Constraints. In Proceedings of the 19th International Conference on Automata, Languages and Programming, Vienna, Austria, 1992.

    Google Scholar 

  29. H. Comon, personal communication, 1993.

    Google Scholar 

  30. Evelyne Contejean. Eléments pour la Décidabilité de l'Unification Modulo la Distributivité. PhD thesis, Université de Paris-Sud, Orsay, France, 1992.

    Google Scholar 

  31. Evelyne Contejean. A partial solution for D-unification based on a reduction to AC1-unification. In Proceedings of the Twentieth International Colloquium on Automata, Languages and Programming (Lund, Sweden, July 1993), Lecture Notes in Computer Science, Berlin. Springer-Verlag.

    Google Scholar 

  32. Evelyne Contejean, personal communication, 1993.

    Google Scholar 

  33. 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 (Chapel Hill, NC), volume 355 of Lecture Notes in Computer Science, pages 109–120, Berlin, April 1989. Springer-Verlag.

    Google Scholar 

  34. [Dauchet et al., 1990] Max Dauchet, Thierry Heuillard, Pierre Lescanne, and Sophie Tison. Decidability of the confluence of finite ground term rewriting systems and of other related term rewriting systems. Information and Computation, 88(2):187–201, October 1990.

    MATH  MathSciNet  Google Scholar 

  35. M. Dauchet and S. Tison. The theory of ground rewrite systems is decidable. In Proceedings of the Fifth Symposium on Logic in Computer Science, pages 242–248, Philadelphia, PA, June 1990.

    Google Scholar 

  36. C. Delor and L. Puel. Extension of the associative path ordering to a chain of associative commutative symbols. In C. Kirchner, editor, Proceedings of the Fifth International Conference on Rewriting Techniques and Applications (Montreal, Canada), Lecture Notes in Computer Science, Berlin, 1993. Springer-Verlag.

    Google Scholar 

  37. Nachum Dershowitz. Hierarchical termination. Technical report 93-?, Leibnitz Center for Research in Computer Science, Hebrew University, Jerusalem, Israel, 1993.

    Google Scholar 

  38. Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics, chapter 6, pages 243–320. North-Holland, Amsterdam, 1990.

    Google Scholar 

  39. [Dershowitz et al., 1991a] Nachum Dershowitz, Jean-Pierre Jouannaud, and Jan Willem Klop. Open problems in rewriting. In R. Book, editor, Proceedings of the Fourth International Conference on Rewriting Techniques and Applications (Como, Italy), volume 488 of Lecture Notes in Computer Science, pages 445–456, Berlin, April 1991. Springer-Verlag.

    Google Scholar 

  40. [Dershowitz et al., 1991b] Nachum Dershowitz, Jean-Pierre Jouannaud, and Jan Willem Klop. Open problems in rewriting. Technical report CS-R9114, Computer Science, CWI, Amsterdam, December 1991.

    Google Scholar 

  41. [Dershowitz et al., 1991c] Nachum Dershowitz, Stéphane Kaplan, and David A. Plaisted. Rewrite, rewrite, rewrite, rewrite, rewrite,.... Theoretical Computer Science, 83(1):71–96, 1991.

    MATH  MathSciNet  Google Scholar 

  42. Nachum Dershowitz and Mitsuhiro Okada. A rationale for conditional equational programming. Theoretical Computer Science, 75:111–138, 1990.

    MATH  MathSciNet  Google Scholar 

  43. Nachum Dershowitz and David A. Plaisted. Equational programming. In J. E. Hayes, D. Michie, and J. Richards, editors, Machine Intelligence 11: The logic and acquisition of knowledge, chapter 2, pages 21–56. Oxford Press, Oxford, 1988.

    Google Scholar 

  44. Hervé Devie. Une Approche Algébrique de la Réécriture et son Application à la dérivation de Procédures de Complétion. PhD thesis, Université de Paris-Sud, Orsay, France, 1991.

    Google Scholar 

  45. Phillipe Devienne, personal communication, 1993.

    Google Scholar 

  46. A. J. J. Dick and P. Watson. Order-sorted term rewriting. Computing J., 34(1):16–19, February 1991.

    MathSciNet  Google Scholar 

  47. Volker Diekert, editor. Proceedings of the Workshop of the ERBA-Working-Group No. 3166 on Algebraic and Syntactic Methods in Computer Science (ASMICS), Munich, Germany, January 1990. Technische Universität München.

    Google Scholar 

  48. Daniel Dougherty. Adding algebraic rewriting to the untyped lambda calculus (extended abstract). In Ron Book, editor, Proceedings of the Fourth International Conference on Rewriting Techniques and Applications (Como, Italy), volume 488 of Lecture Notes in Computer Science, pages 37–48, Berlin, April 1991. Springer-Verlag.

    Google Scholar 

  49. Maribel Fernández. AC-complement problems: Validity and negation elimination. In C. Kirchner, editor, Proceedings of the Fifth International Conference on Rewriting Techniques and Applications (Montreal, Canada), Lecture Notes in Computer Science, Berlin, 1993. Springer-Verlag.

    Google Scholar 

  50. R. Freese, personal communication, 1993.

    Google Scholar 

  51. Laurent Fribourg. SLOG: A logic programming language interpreter based on clausal superposition and rewriting. In Proceedings of the Symposium on Logic Programming, pages 172–184, Boston, MA, July 1985. IEEE.

    Google Scholar 

  52. R. Gilleron. Decision problems for term rewriting systems and recognizable tree languages. In Proceedings of the Eighth Symposium on Theoretical Aspects of Computer Science, February 1991.

    Google Scholar 

  53. [Gilleron et al., 1993] Rémy Gilleron, Sophie Tison, and Marc Tommasi. Solving systems of set constraints using tree automata. In Proceedings of the Symposium on Theoretical Aspects of Computer Science (Würzburg, Germany), Lecture Notes in Computer Science, Berlin, 1993. Springer-Verlag.

    Google Scholar 

  54. [Goguen et al., 1987] J. A. Goguen, C. Kirchner, and J. Meseguer. Concurrent term rewriting as a model of computation. In R. Keller and J. Fasel, editors, Proceedings of Graph Reduction Workshop (Santa Fe, NM), volume 279 of Lecture Notes in Computer Science, pages 53–93. Springer-Verlag, 1987.

    Google Scholar 

  55. Philipp Hanschke and Jörg Würtz. Satisfiability of the smallest binary program. Information Processing Letters, 45(5):237–241, April 1993.

    MATH  MathSciNet  Google Scholar 

  56. Nevin Heintze and Joxan Jaffar. A decision procedure for a class of set constraints. In Proceedings of the Fifth Symposium on Logic in Computer Science (Philadelphia, PA), pages 42–51. IEEE, June 1990.

    Google Scholar 

  57. D. Hofbauer and M. Huber. Computing linearizations using test sets. In M. Rusinowitch, editor, Proceedings of the Third International Workshop on Conditional Rewriting Systems (Pont-a-Mousson, France, July 1992), volume 656 of Lecture Notes in Computer Science, pages 287–301, Berlin, January 1993. Springer-Verlag.

    Google Scholar 

  58. B. Hoffmann and D. Plump. Implementing term rewriting by jungle evaluation. RAIRO Theoretical Informatics and Applications, 25(5):445–472, 1991.

    MATH  MathSciNet  Google Scholar 

  59. [Hsiang et al., 1992] Jieh Hsiang, Helene Kirchner, Pierre Lescanne, and Michael Rusinowitch. The term rewriting approach to automated theorem proving. J. Logic Programming, 14(1&2):71–99, October 1992.

    MATH  MathSciNet  Google Scholar 

  60. Gérard Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. J. of the Association for Computing Machinery, 27(4):797–821, October 1980.

    MATH  MathSciNet  Google Scholar 

  61. Gérard Huet and Derek C. Oppen. Equations and rewrite rules: A survey. In R. Book, editor, Formal Language Theory: Perspectives and Open Problems, pages 349–405, New York, 1980. Academic Press.

    Google Scholar 

  62. P. Inverardi and M. Nesi. Infinite normal forms for non linear term rewriting systems. Technical Report B4-41, Istituto di Elaborazione, Pisa, Italy, October 1991.

    Google Scholar 

  63. Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT Press, Cambridge, MA, 1991.

    Google Scholar 

  64. Jean-Pierre Jouannaud and Hélène Kirchner. Completion of a set of rules modulo a set of equations. SIAM J. on Computing, 15:1155–1194, November 1986.

    MATH  MathSciNet  Google Scholar 

  65. Jean-Pierre Jouannaud and Emmanuel Kounalis. Automatic proofs by induction in equational theories without constructors. Information and Computation, 81(1):1–33, 1989.

    MathSciNet  Google Scholar 

  66. Jean-Pierre Jouannaud and Claude Marché. Completion modulo associativity, commutativity and identity. In Alfonso Miola, editor, Proceedings of the International Symposium on the Design and Implementation of Symbolic Computation Systems (Capri, Italy), volume 429 of Lecture Notes in Computer Science, pages 111–120, Berlin, April 1990. Springer-Verlag.

    Google Scholar 

  67. Jean-Pierre Jouannaud and Mitsuhiro Okada. Executable higher-order algebraic specification languages. In Proceedings of the Sixth Symposium on Logic in Computer Science, pages 350–361, Amsterdam, The Netherlands, 1991. IEEE.

    Google Scholar 

  68. Jean-Pierre Jouannaud and Mitsuhiro Okada. Satisfiability of systems of ordinal notations with the subterm property is decidable. In J. Leach Albert, B. Monien, and M. Rodríguez Artalejo, editors, Proceedings of the Eighteenth EATCS Colloquium on Automata, Languages and Programming (Madrid, Spain), volume 510 of Lecture Notes in Computer Science, pages 455–468, Berlin, July 1991. Springer-Verlag.

    Google Scholar 

  69. Deepak Kapur and Paliath Narendran. Double-exponential complexity of computing a complete set of AC-unifiers (Preliminary report). In Proceedings of the Seventh Symposium on Logic in Computer Science, pages 11–21, Santa Cruz, CA, June 1992. IEEE.

    Google Scholar 

  70. [Kapur et al., 1987] Deepak Kapur, Paliath Narendran, and Hantao Zhang. On sufficient completeness and related properties of term rewriting systems. Acta Informatica, 24(4):395–415, August 1987.

    MATH  MathSciNet  Google Scholar 

  71. [Kapur et al., 1990] Deepak Kapur, G. Sivakumar, and Hantao Zhang. A new method for proving termination of AC-rewrite systems. In Proceedings of the Tenth International Conference of Foundations of Software Technology and Theoretical Computer Science, volume 472 of Lecture Notes in Computer Science, pages 133–148, Berlin, 1990. Springer-Verlag.

    Google Scholar 

  72. [Kennaway et al., 1990] J. R. Kennaway, J. W. Klop, M. R. Sleep, and F. J. de Vries. Transfinite reductions in orthogonal term rewriting systems. Technical Report CS-R9041, CWI, Amsterdam, 1990.

    Google Scholar 

  73. [Kennaway et al., 1991] J. R. Kennaway, J. W. Klop, M. R. Sleep, and F. J. de Vries. Transfinite reductions in orthogonal term rewriting systems (Extended abstract). In Ron Book, editor, Proceedings of the Fourth International Conference on Rewriting Techniques and Applications (Como, Italy), Lecture Notes in Computer Science, pages 1–12, Berlin, April 1991. Springer-Verlag.

    Google Scholar 

  74. C. Kirchner and H. Kirchner. Constrained equational reasoning. In Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, Portland (Oregon), pages 382–389. ACM Press, July 1989. Report CRIN 89-R-220.

    Google Scholar 

  75. [Kirchner et al., 1990] C. Kirchner, H. Kirchner, and M. Rusinowitch. Deduction with symbolic constraints. RAIRO Theoretical Informatics and Applications, 4(3):9–52, 1990. Special issue on Automatic Deduction.

    Google Scholar 

  76. Jan Willem Klop. Combinatory Reduction Systems, volume 127 of Mathematical Centre Tracts. Mathematisch Centrum, Amsterdam, 1980.

    Google Scholar 

  77. Jan Willem Klop. Term rewriting systems. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, chapter 1, pages 1–117. Oxford University Press, Oxford, 1992.

    Google Scholar 

  78. Emmanuel Kounalis and Denis Lugiez. Compilation of pattern matching with associative commutative functions. In Proceedings of the International Joint Conference on Theory and Practice of Software Development, volume 1: Colloquium on Trees in Algebra and Programming (Brighton, U.K.), Lecture Notes in Computer Science, pages 57–73, Berlin, April 1991. Springer-Verlag.

    Google Scholar 

  79. [Kounalis et al., 1991] Emmanuel Kounalis, Denis Lugiez, and L. Pottier. A solution of the complement problem in associative-commutative theories. In A. Tarlecki, editor, Proceedings of the Sixteenth International Symposium on Mathematical Foundations of Computer Science (Kazimierz Dolny, Poland), volume 520 of Lecture Notes in Computer Science, pages 287–297, Berlin, September 1991. Springer-Verlag.

    Google Scholar 

  80. Joseph B. Kruskal. Well-quasi-ordering, the Tree Theorem, and Vazsonyi's conjecture. Transactions of the American Mathematical Society, 95:210–225, May 1960.

    MATH  MathSciNet  Google Scholar 

  81. G. Kucherov. On relationship between term rewriting systems and regular tree languages. In Ron Book, editor, Proceedings of the Fourth International Conference on Rewriting Techniques and Applications (Como, Italy), volume 488 of Lecture Notes in Computer Science, pages 299–311, Berlin, April 1991. Springer-Verlag.

    Google Scholar 

  82. G. Kucherov and M. Tajine. Decidability of regularity and related properties of ground normal form languages. In M. Rusinowitch, editor, Proceedings of the Third International Workshop on Conditional Rewriting Systems (Ponta-Mousson, France, July 1992), volume 656 of Lecture Notes in Computer Science, pages 272–286, Berlin, January 1993. Springer-Verlag. To appear in Information and Computation.

    Google Scholar 

  83. M. Kurihara and A. Ohuchi. Modularity of simple termination of term rewriting systems with shared constructors. Theoretical Computer Science, 103:273–282, 1992.

    MATH  MathSciNet  Google Scholar 

  84. W. Kurth. Termination und Konfluenz von Semi-Thue-Systems mit nur einer Regel. PhD thesis, Technische Universitat Clausthal, Clausthal, Germany, 1990.

    Google Scholar 

  85. Dallas S. Lankford. Canonical inference. Memo ATP-32, Automatic Theorem Proving Project, University of Texas, Austin, TX, December 1975.

    Google Scholar 

  86. Dallas S. Lankford. On proving term rewriting systems are Noetherian. Memo MTP-3, Mathematics Department, Louisiana Tech. University, Ruston, LA, October 1979.

    Google Scholar 

  87. J.-L. Lassez and K. G. Marriott. Explicit representation of terms defined by counter examples. J. Automated Reasoning, 3(3):1–17, September 1987.

    MathSciNet  Google Scholar 

  88. P. Lescanne. Well rewrite orderings. In J. Mitchell, editor, Proceedings of the Fifth Symposium on Logic in Computer Science, pages 239-256, Philadelphia, PA, 1990.

    Google Scholar 

  89. Pierre Lescanne. Termination of rewrite systems by elementary interpretations. In H. Kirchner and G. Levi, editors, Proceedings of the Third International Conference on Algebraic and Logic Programming (Pisa, Italy), volume 632 of Lecture Notes in Computer Science, pages 21–36. Springer-Verlag, September 1992.

    Google Scholar 

  90. [Litovski et al., to appear] Igor Litovski, Yves Métivier, and Eric Sopena. Definitions and comparisons of local computations on graphs. Mathematical Systems Theory, to appear. Available as internal report 91-43 of LaBRI, University of Bordeaux 1.

    Google Scholar 

  91. D. Lugiez and J.-L. Moysset. Complement problems and tree automata in AC-like theories. In Proceedings of the Symposium on Theoretical Aspects of Computer Science (Würzburg, Germany), Lecture Notes in Computer Science, Berlin, 1993. Springer-Verlag.

    Google Scholar 

  92. Claude Marché, personal communication, 1993.

    Google Scholar 

  93. José Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96:73–155, 1992.

    MATH  MathSciNet  Google Scholar 

  94. Yves Métivier. Calcul de longueurs de chaînes de réécriture dans le monoïde libre. Theoretical Computer Science, 35(1):71–87, January 1985.

    MATH  MathSciNet  Google Scholar 

  95. Aart Middeldorp. Modular Properties of Term Rewriting Systems. PhD thesis, Vrije Universiteit, Amsterdam, The Netherlands, 1990.

    Google Scholar 

  96. Aart Middeldorp and Yoshihito Toyama. Completeness of combinations of constructor systems. In R. Book, editor, Proceedings of the Fourth International Conference on Rewriting Techniques and Applications (Como, Italy), volume 488 of Lecture Notes in Computer Science, pages 174–187, Berlin, April 1991. Springer-Verlag.

    Google Scholar 

  97. [Milner et al., 1992] R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I and II. Information and Computation, 100:1–77, 1992.

    MATH  MathSciNet  Google Scholar 

  98. Fritz Müller. Confluence of the lambda calculus with left-linear algebraic rewriting. Information Processing Letters, 41:293–299, April 1992.

    MATH  MathSciNet  Google Scholar 

  99. Tobias Nipkow. Higher-order critical pairs. In Proceedings of the Sixth Symposium on Logic in Computer Science, pages 342–349, Amsterdam, The Netherlands, 1991. IEEE.

    Google Scholar 

  100. Robert Nieuwenhuis. A new ordering constraint solving method and its applications. In C. Kirchner, editor, Proceedings of the Fifth International Conference on Rewriting Techniques and Applications (Montreal, Canada), Lecture Notes in Computer Science, Berlin, 1993. Springer-Verlag.

    Google Scholar 

  101. Michael J. O'Donnell. Equational Logic as a Programming Language. MIT Press, Cambridge, MA, 1985.

    MATH  Google Scholar 

  102. V. van Oostrom. Confluence by decreasing diagrams. IR 298, Vrije Universiteit, Amsterdam, The Netherlands, August 1992. To appear in Theoretical Computer Science.

    Google Scholar 

  103. M. Oyamaguchi. The Church-Rosser property for ground term rewriting systems is decidable. Theoretical Computer Science, 49(1):43–79, 1987.

    MATH  MathSciNet  Google Scholar 

  104. M. Oyamaguchi and Y. Ohta. On the confluent property of tight-ground term rewriting systems. Trans. IEICE, J76-D-I:39–45, 1993.

    Google Scholar 

  105. Gerald E. Peterson and Mark E. Stickel. Complete sets of reductions for some equational theories. J. of the Association for Computing Machinery, 28(2):233–264, April 1981.

    MATH  MathSciNet  Google Scholar 

  106. D. Plump. Implementing term rewriting by graph reduction: Termination of combined systems. In S. Kaplan and M. Okada, editors, Proceedings of the Second International Workshop on Conditional and Typed Rewriting Systems (Montreal, Canada, June 1990), volume 516 of Lecture Notes in Computer Science, pages 307–317, Berlin, 1991. Springer-Verlag.

    Google Scholar 

  107. D. Plump. Hypergraph rewriting: Critical pairs and undecidability of confluence. In M. R. Sleep, M. J. Plasmeijer, and M. C. van Eekelen, editors, Term Graph Rewriting: Theory and Practice, chapter 15. Wiley, 1993. To appear.

    Google Scholar 

  108. Uday S. Reddy. On the relationship between logic and functional languages. In D. DeGroot and G. Lindstrom, editors, Logic Programming: Functions, Relations, and Equations, pages 3–36. Prentice-Hall, Englewood Cliffs, NJ, 1986.

    Google Scholar 

  109. Christophe Ringeissen. Unification in a combination of equational theories with shared constants and its application to primal algebras. In A. Voronkov, editor, Proceedings of the Conference on Logic Programming and Automated Reasoning (St. Petersburg, Russia), volume 624 of Lecture Notes in Artificial Intelligence, Berlin, July 1992. Springer-Verlag.

    Google Scholar 

  110. Neil Robertson and P. D. Seymour. Graph minors IV. Tree-width and well-quasi-ordering. Submitted 1982; revised January 1986.

    Google Scholar 

  111. A. Rubio and R. Nieuwenhuis. A precedence-based total AC-compatible ordering. In C. Kirchner, editor, Proceedings of the Fifth International Conference on Rewriting Techniques and Applications (Montreal, Canada), Lecture Notes in Computer Science, Berlin, 1993. Springer-Verlag.

    Google Scholar 

  112. M. Schmidt-Schauß. Unification in a combination of arbitrary disjoint equational theories. J. Symbolic Computation, 8(1&2):51–99, 1989.

    MATH  Google Scholar 

  113. R. Statman. There is no hyperrecurrent S,K combinator. Research Report 91-133, Department of Mathematics, Carnegie Mellon University, Pittsburgh, PA, 1991.

    Google Scholar 

  114. R. Statman. A short note on a problem of Ray Smullyan. Rapport, Institut National de Rechereche en Informatique et en Automatique, Le Chesnay, France, 1992.

    Google Scholar 

  115. M. Tajine. Negation elimination for syntactic equational formula. In C. Kirchner, editor, Proceedings of the Fifth International Conference on Rewriting Techniques and Applications (Montreal, Canada), Lecture Notes in Computer Science, Berlin, 1993. Springer-Verlag.

    Google Scholar 

  116. M. Takahashi. λ-calculi with conditional rules. In M. Bezem and J. F. Groote, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications (Utrecht, The Netherlands), volume 664 of Lecture Notes in Computer Science, pages 406–417, Berlin, 1993. Springer-Verlag.

    Google Scholar 

  117. A. Thue. Probleme über veranderungen von zeichenreihen nach gegeben regeln. Skr. Vid. Kristianaia I. Mat. Naturv. Klasse, 10/34, 1914.

    Google Scholar 

  118. Erik Tiden and Stefan Arnborg. Unification problems with one-sided distributivity. J. of Symbolic Computation, 3:183–202, 1987.

    MATH  MathSciNet  Google Scholar 

  119. Yoshihito Toyama. On the Church-Rosser property for the direct sum of term rewriting systems. J. of the Association for Computing Machinery, 34(1):128–143, January 1987.

    MATH  MathSciNet  Google Scholar 

  120. [Toyama et al., 1989] Yoshihito Toyama, Jan Willem Klop, and Hendrik Pieter Barendregt. Termination for the direct sum of left-linear term rewriting systems. In Nachum Dershowitz, editor, Proceedings of the Third International Conference on Rewriting Techniques and Applications (Chapel Hill, NC), volume 355 of Lecture Notes in Computer Science, pages 477–491, Berlin, April 1989. Springer-Verlag.

    Google Scholar 

  121. Ralf Treinen. A new method for undecidability proofs of first order theories. In K. V. Nori and C. E. Veni Madhavan, editors, Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science, volume 472 of Lecture Notes in Computer Science, pages 48–62. Springer-Verlag, 1990.

    Google Scholar 

  122. Ralf Treinen. A new method for undecidability proofs of first order theories. J. Symbolic Computation, 14(5):437–457, November 1992.

    MATH  MathSciNet  Google Scholar 

  123. S. Vágvölgyi and R. Gilleron. For a rewrite system it is decidable whether the set of irreducible, ground terms is decidable. Bulletin of the European Association for Theoretical Computer Science, 48:197–209, October 1992.

    MATH  Google Scholar 

  124. K. N. Venkataraman. Decidability of the purely existential fragment of the theory of term algebras. J. of the Association for Computing Machinery, 34(2):492–510, 1987.

    MathSciNet  Google Scholar 

  125. M. Venturini-Zilli. Reduction graphs in the Lambda Calculus. Theoretical Computer Science, 29:251–275, 1984.

    MATH  MathSciNet  Google Scholar 

  126. A. Visser. Numerations, lambda calculus, and arithmetic. In Hindley and Seldin, editors, Essays on Combinatory Logic, Lambda-Calculus, and Formalism, pages 259–284. Academic Press, 1980.

    Google Scholar 

  127. Andreas Weiermann. Well-rewrite orderings and the induced recursive path orderings. Unpublished note, Institut für Mathematische Logik und Grundlagenforschung, 1992.

    Google Scholar 

  128. C. Wrathall. Confluence of one-rule Thue systems. In Proceedings of the First International Workshop on Word Equations and Related Topics (Tubingen), volume 572 of Lecture Notes in Computer Science, pages 237–246, Berlin, 1990. Springer-Verlag.

    Google Scholar 

  129. H. Zantema. Type removal in term rewriting. In M. Rusinowitch, editor, Proceedings of the Third International Workshop on Conditional Rewriting Systems (Pont-a-Mousson, France, July 1992), volume 656 of Lecture Notes in Computer Science, pages 148–154, Berlin, January 1993. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Illinois, 1304 West Springfield Avenue, 61801, Urbana, IL, USA

    Nachum Dershowitz

  2. Laboratoire de Recherche en Informatique, Bat. 490, Université de Paris Sud, 91405, Orsay, France

    Jean-Pierre Jouannaud

  3. CWI, Kruislaan 413, 1098, SJ Amsterdam, The Netherlands

    Jan Willem Klop

  4. Department of Mathematics and Computer Science, Free University, de Boelelaan 1081, 1081, HV Amsterdam, The Netherlands

    Jan Willem Klop

Authors
  1. Nachum Dershowitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Pierre Jouannaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jan Willem Klop
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INRIA Lorraine and CRIN, 615 Rue du Jardin Botanique, F-54602, Villers les Nancy Cedex, France

    Claude Kirchner

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dershowitz, N., Jouannaud, JP., Klop, J.W. (1993). More problems in rewriting. In: Kirchner, C. (eds) Rewriting Techniques and Applications. RTA 1993. Lecture Notes in Computer Science, vol 690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21551-7_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-21551-7_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56868-1

  • Online ISBN: 978-3-662-21551-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation