Advertisement

Current trends in rewriting techniques and related problems

  • Pierre Lescanne
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 296)

Keywords

Inference Rule Equational Theory Unification Algorithm Ground Term Automate Deduction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    L. Bachmair and N. Dershowitz. Critical Pair Criteria for the Knuth-Bendix Completion Procedure. Technical Report, Department of Computer Science, U. Illinois, Urbana-Champaign, 1986.Google Scholar
  2. [2]
    L. Bachmair, N. Dershowitz, and J. Hsiang. Orderings for equational proofs. In Proc. 1st IEEE Symp. Logic in Computer Science, Cambridge, Massachussetts, June 1986.Google Scholar
  3. [3]
    L. Bachmair and D.A. Plaisted. Termination orderings for associative-commutative rewriting systems. Journal of Symbolic Computation, 1985.Google Scholar
  4. [4]
    F. Bellegarde and P. Lescanne. Transformation ordering. In 12th Coll. on Trees in Algebra and Programming, TAPSOFT, Springer Verlag, 1987.Google Scholar
  5. [5]
    A. BenCherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 1987.Google Scholar
  6. [6]
    A. Colmerauer. Equations and inequations on finite and infinite trees. In Proc. FGCS'84, pages 85–99, November 1984.Google Scholar
  7. [7]
    H. Comon. Sufficient completeness, term rewriting system and anti-unification. In J. Siekmann, editor, Proc. 8th Conference on Automated Deduction, Oxford, pages 128–140, Springer Verlag, Lecture Notes in Computer Science, Oxford (England), 1986.Google Scholar
  8. [8]
    G. Cousineau, L. Paulson, G. Huet, R. Milner, M. Gordon, and C. Wadsworth. The ML Handbook. INRIA, Rocquencourt, May 1985.Google Scholar
  9. [9]
    M. Dauchet, T. Heuillard, P. Lescanne, and S. Tison. Decidability of the confluence of ground term rewriting systems. In Proc. 2nd IEEE Symp. on Logic In Computer Science, Ithaca, New York, 1987.Google Scholar
  10. [10]
    N. Dershowitz. Applications of the Knuth-Bendix Completion Procedure. Technical Report ATR-83(8478), Laboratory Operation, Aerospace Corporation, El Segundo, CA 90245, May 1983.Google Scholar
  11. [11]
    N. Dershowitz. Completion and its applications. In Proc. Colloquium on Resolution of Equations in Algebraic Structures, MCC, 3500 West Balconies Center Drive, Austin, Texas 787596509, May 4–6 1987.Google Scholar
  12. [12]
    N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:279–301, 1982.CrossRefGoogle Scholar
  13. [13]
    L. Fribourg. A strong restriction of the completion procedure for theories with constructors. In L. Kott, editor, Int. Coll. on Automata Languages and Programming, Springer Verlag, Lecture Notes in Computer Science, 1986.Google Scholar
  14. [14]
    J.H. Gallier and W. Snyder. A general complete E-unification procedure. In P. Lescanne, editor, 2nd Conf. on Rewriting Techniques and Applications, Springer Verlag, Lecture Notes in Computer Science, 1987.Google Scholar
  15. [15]
    H. Ganzinger. Ground term confluence in parametric conditional equational specifications. In F.J. Brandenburg, G. Vidal-Naquet, and M. Wirsing, editors, STACS 87, pages 286–298, Springer Verlag, 1987.Google Scholar
  16. [16]
    I. Gnaedig and P. Lescanne. Proving termination of associative rewriting systems by rewriting. In J. Siekmann, editor, Proc. 8th Conference on Automated Deduction, Oxford, Springer Verlag, Lecture Notes in Computer Science, Oxford (England), 1986.Google Scholar
  17. [17]
    J. Goguen, C. Kirchner, and J. Meseguer. Concurrent term rewriting as a model of computation. In Graph reduction Workshop, Santa Fe, NM, September 1986.Google Scholar
  18. [18]
    J.A. Goguen. How to prove algebraic inductive hypotheses without induction, with applications to the correctness of data type implementation. In W. Bibel and Kowalski, editors, Proc. 5th Conf. on Automated Deduction, pages 356–373, Springer Verlag, Lecture Notes in Computer Science, 1980.Google Scholar
  19. [19]
    A. Herold. Combination of unification algorithms. In Proc. 8th Conference on Automated Deduction, Oxford, pages 450–469, Springer Lecture Notes in Computer Science 230, 1986.Google Scholar
  20. [20]
    S. Hölldobler. A unification algorithm for confluent theories. In 14th Int. Coll. on Automata, Languages and Programming, 1987.Google Scholar
  21. [21]
    J. Hsiang and M. Rusinowitch. On word problems in equational theories. In Int. Coll. on Automata Languages and Programming, 1987.Google Scholar
  22. [22]
    G. Huet. A complete proof of correctness of the Knuth and Bendix completion algorithm. Journal of Computer Systems and Sciences, 23:11–21, 1981.CrossRefGoogle Scholar
  23. [23]
    G. Huet. Formal Structures for Computation and Deduction. Technical Report, INRIA, May 1986.Google Scholar
  24. [24]
    G. Huet and J.M. Hullot. Proofs by induction in equational theories with constructors. J. Comp. Sys. Sc., 25:239–266, 1982.CrossRefGoogle Scholar
  25. [25]
    G. Huet and J.J. Levy. Call By Need Computations in Non-Ambiguous Linear Term Rewriting Systems. Technical Report 359, Laboria, August 1979.Google Scholar
  26. [26]
    J.M. Hullot. Canonical forms and unification. In Proc. of the 5th Conf. on Automated Deduction, pages 318–334, Springer Verlag, Lecture Notes in Computer Science, Les Arcs, France, July 1980.Google Scholar
  27. [27]
    H. Hussmann. Unification in conditional equational theories. In Proc. of EUROCAL, Springer Verlag, 1985.Google Scholar
  28. [28]
    J. P. Jouannaud and B. Waldmann. Reductive conditional term rewriting systems. In Proc. 3rd IFIP Conf. on Formal Description of Programming Concepts, Lyngby (Danemark), 1986.Google Scholar
  29. [29]
    J.P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal on Computing, 15(4):1155–1194, 1986.CrossRefGoogle Scholar
  30. [30]
    J.P. Jouannaud and E. Kounalis. Proofs by induction in equational theories without constructors. In Proc. 1rst IEEE Symp. on Logic in Computer Science, IEEE, Cambridge, Massachusetts, (USA), 1986.Google Scholar
  31. [31]
    J.P. Jouannaud, P. Lescanne, and F. Reinig. Recursive decomposition ordering. In Bjorner D., editor, Formal Description of Programming Concepts 2, pages 331–346, North Holland, Garmish Partenkirschen, RFA, 1982.Google Scholar
  32. [32]
    S. Kaplan. Fair Conditional Term Rewriting Systems: Unification, Termination and Confluence. Technical Report, U. of Paris Sud, Orsay, Orsay, 1984. Conditional rewriting.Google Scholar
  33. [33]
    S. Kaplan and J-L. Remy. Completion algorithms for conditional rewriting systems. In Proc. Colloquium on Resolution of Equations in Algebraic Structures, MCC, 3500 West Balconies Center Drive, Austin, Texas 78759-6509, May 4–6 1987.Google Scholar
  34. [34]
    D. Kapur and D.R. Musser. Proof by consistency. Artificial Intelligence, 31(2):125–157, 1987.CrossRefGoogle Scholar
  35. [35]
    C. Kirchner. Computing unification algorithms. In Proc. 1st IEEE Symp. on Logic in Computer Science, Boston (USA), pages 206–216, 1986.Google Scholar
  36. [36]
    C. Kirchner, Méthodes et outils de conception systématique d'algorithmes d'unification dans les théories équationnelles. PhD thesis, Université de Nancy 1, 1985.Google Scholar
  37. [37]
    C. Kirchner, editor. Proceedings on a workshop on Unification. Centre de Recherche en Informatique de Nancy, BP 239, 54506 Vandœuvre-les-Nancy, France, 1987.Google Scholar
  38. [38]
    C. Kirchner and H. Kirchner. Reveur-3 the implementation of a general completion procedure parametrized by built in theories and strategies. Science for Computer Programming, 20, 1986.Google Scholar
  39. [39]
    C. Kirchner and P. Lescanne. Solving disequations. In Proc. 2nd Symp. on Logic in Computer Science, 1987.Google Scholar
  40. [40]
    H. Kirchner. A general inductive completion algorithm and abstract data types. In Proc. 7th international Conference on Automated Deduction, Springer Verlag, Lecture Notes in Computer Science, Napa Valley (California, USA), 1984.Google Scholar
  41. [41]
    D. Knuth and P. Bendix. Simple Word Problems in Universal Algebras, pages 263–297. Pergamon Press, 1970.Google Scholar
  42. [42]
    E. Kounalis. Validation de spécifications algébriques par complétion inductive. PhD thesis, Université de Nancy 1, 1985.Google Scholar
  43. [43]
    W. Küchlin. Equational Completion by Proof Transformation. PhD thesis, Swiss Federal Institute of Technology (ETH), CH-8092 Zurich, Switzerland, June 1986.Google Scholar
  44. [44]
    W. Küchlin. Inductive Completion by Proof Transformation. Technical Report 87-08, Computer and Information Sciences, University Deleware, February 1987.Google Scholar
  45. [45]
    D.S. Lankford. A simple explanation of inductionless induction. Technical Report, Lousiana Tech, Ruston (Louisiana), 1981.Google Scholar
  46. [46]
    A. Laville. Lazy pattern matching. Technical Report, U. of Reims, France, 1987.Google Scholar
  47. [47]
    A. Lazrek, P. Lescanne, and J-J. Thiel. Proving inductive equalities, Algorithms and Implementation. Technical Report, CRIN 86-R-087, Centre de Recherche en Informatique de Nancy, 1986.Google Scholar
  48. [48]
    P. Lescanne. Divergence of the Knuth-Bendix procedure and termination orderings. Bull. EATCS, 30:80–83, October 1986.Google Scholar
  49. [49]
    P. Lescanne, editor. Rewriting Techniques and Applications. Volume 256, Springer Verlag, May 1987.Google Scholar
  50. [50]
    A. Martelli, C. Moiso, and G-F. Rossi. Lazy unification algorithms for canonical rewrite systems. In Proc. Colloquium on Resolution of Equations in Algebraic Structures, MCC, 3500 West Balconies Center Drive, Austin, Texas 78759-6509, May 4–6 1987.Google Scholar
  51. [51]
    A. Martelli and U. Montanari. An efficient unification algorithm. ACM T.O.P.L.A.S, 4(2):258–282, 1982.Google Scholar
  52. [52]
    D. L. Musser. On proving inductive properties of abstract data types. Proc. of the 7th Annual Acm Symposium on Principles of Programming Languages, 154–162, 1980.Google Scholar
  53. [53]
    J. Mazali. Filtrage associatif, commutatif ou idempotent. In Proc. Hardware and Software Components and Architectures for 5th Generation, pages 243–258, AFCET, Paris (France), March 1985.Google Scholar
  54. [54]
    J. Mzali. Méthodes de filtrage équationnel et de preuve automatique de théorèmes. PhD thesis, Université de Nancy 1, September 1986.Google Scholar
  55. [55]
    M. H. A. Newman. On theories with a combinatorial definition of Equivalence. Annals of Math, 43(2):223–243, 1942.Google Scholar
  56. [56]
    M. J. O'Donnell. Equational Logic as a Programming Language. Foundations of Computing, MIT Press, 1985.Google Scholar
  57. [57]
    M. Oyamaguchi. The Church-Rosser Property for Ground Term Rewriting Systems is Decidable. Technical Report, Faculty of Engineering, Mie University, Tsu 514, Japan, 1987.Google Scholar
  58. [58]
    M. Oyamaguchi. Sufficient sequentiality: a decidable condition for call-by-need computations in term rewriting systems. COMP86-38, 1986.Google Scholar
  59. [59]
    E. Paul. Proof by induction in equational theories with relations between constructors. In B. Courcelle, editor, Proc. 9th Colloquium on trees in Algebra and Programming, pages 210–225, Cambridge University Press, 1984.Google Scholar
  60. [60]
    G. Peterson and M. Stickel. Complete sets of reduction for equational theories with complete unification algorithms. J. of ACM, 28(2):233–264, 1981.CrossRefGoogle Scholar
  61. [61]
    D. Plaisted. Semantic confluence and completion method. Information and Control, 65:182–215, 1985.CrossRefGoogle Scholar
  62. [62]
    G. Plotkin. Lattice-Theoretic Properties of Subsumption. Technical Report Memo Mip-R-77, U. of Edinburgh, 1970.Google Scholar
  63. [63]
    L. Puel. Ensembles inévitables d'arbres et applications à la généralisation du théorème de Kruskal. C.R. Acad. Sc. Paris, serie I, 301(18), 1985.Google Scholar
  64. [64]
    L. Puel. Proof in the final algebra. In B. Courcelle, editor, Proc. 9th Coll. on Trees in Algebra and Programming, pages 227–242, Cambridge University Press, 1984.Google Scholar
  65. [65]
    L. Puel. Using Unavoidable Sets of Trees to Generalize Kruskal's Theorem. Technical Report, Laboratoire d'Informatique de l'Ecole Normale Supérieure, Paris, 1986.Google Scholar
  66. [66]
    P. W. Purdom and C. A. Brown. Fast many-to-one matching algorithn. In Proc. 1rst Conf. Rewriting Techniques and Applications, pages 407–416, Springer Verlag, Lecture Notes in Computer Science, May 1985.Google Scholar
  67. [67]
    P. Réty. Improving basic narrowing techniques and commutation properties. In 2nd International Conference on Rewriting Techniques and Applications, 1987.Google Scholar
  68. [68]
    P. Réty, C. Kirchner, H. Kirchner, and P. Lescanne. An algorithm for unification based on narrowing. Technical Report 86-R-131, Centre de Recherche en Informatique de Nancy, 1986.Google Scholar
  69. [69]
    G. Smolka and W. Nutt. Order-sorted equational computation. In H. Ait-Kaci, editor, Coll. on Resolution of Equations in Algebraic Structure, Austin, Texas, 1987.Google Scholar
  70. [70]
    E. Tidèn. Unification in combinations of collapse-free theories with disjoint sets of function symbols. In Proc. 8th Conference on Automated Deduction, Oxford, pages 431–449, Springer Verlag, Lecture Notes in Computer Science, 1986.Google Scholar
  71. [71]
    Y. Toyama. Contrexamples to termination for the direct sum of term rewriting systems. 1986.Google Scholar
  72. [72]
    Y. Toyama. On the Church-Rosser property for the direct sum of term rewriting systems. Journal of the ACM, 1986.Google Scholar
  73. [73]
    F. Winkler and B. Buchberger. A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm. In Colloquium on Algebra, Combinatorics and Logic in Computer Science, Gyor (Hungary), 1983.Google Scholar
  74. [74]
    K. Yelick. Combining unification algorithm for confined equational theories. In Proc. 1st Conference on Rewriting Techniques and Applications, pages 301–324, Springer Verlag, Lecture Notes in Computer Science, Dijon (France), 1985.Google Scholar
  75. [75]
    H. Zhang and J-L Rémy. Contextual rewriting. In Proc. 1st Conference on Rewriting Techniques and Applications, page, Springer Verlag, Dijon (France), 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Pierre Lescanne
    • 1
  1. 1.Centre de Recherche en Informatique de Nancy CNRS and INRIA-Lorraine Campus ScientifiqueVandœuvre-Les-NancyFrance

Personalised recommendations