Termination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 202 LNCS, Issue , 1985, Pages 180-224

  Dershowitz, Nachum ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

REWRITE RULES; REWRITE SYSTEMS; TERMINATION PROOF;

ARTIFICIAL INTELLIGENCE;

EID: 85035005837     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-15976-2_9     Document Type: Conference Paper

References (87)

1. Ait-Kaci, H. “An algorithm for finding a minimal recursive path ordering”, Report MS-CIS-83-7, Department of Computer and Information Science, Univer-sity of Pennsylvania, Philadelphia, PA, 1983.
2. Bachmair, L., and Dershowitz, N. “Commutation, transformation, and termination”. (1985) (submitted).
3. Bachmair, L., and Plaisted, D. A. “Associative path ordering". Proceedings of the First International Conférence on Rewriting Techniques and Applications, Dijon, France (May 1985).
4. Ben Cherifa, A. “Preuve de la terminaison finie d’un système de ree'criture par l’ordre polynomial”, Unpublished manuscript, Centre de Recherche en Informatique de Nancy, Nancy, France, 1984.
5. Bergstra, J. A., and Tucker, J. V. “Equational spécifications for comput-able data types: Six hidden functions suffice and other sufficiency bounds”, Pre-print IW 128/80, Mathematisch Centrum, Amsterdam, The Netherlands, Janu-ary 1980.
6. Bûcher, W., Ehrenfeucht, A., and Haussier, D. “On total regulators gen-erated by dérivation relations”, University of Denver, 1984.
7. Calladine, P. “Personal communication”, Laboratoire d’informatique, Université' de Poitiers, May 1985.
8. Choque, G. “Calcul d’un ensemble complet d’incrémentations minimales pour l’ordre recursif de décomposition”, Technical report, Centre de Recherche en Informatique de Nancy, Nancy, France, 1983.
9. Cohen, P. J. “Décision procédures for real and p-adic fields”. Communications of Pure and Applied Mathematics, Vol. 22, No. 2 (1969), pp. 131-151.
10. Collins, G. “Quantifier élimination for real closed fields by cylindrical algebraic décomposition”. Proceedings Second GI Conférence on Automata Theory and Formai Languages (1975), pp. 134-183.
11. Dauchet, M., and Tison, S. “Decidability of confluence for ground term rewriting Systems”, Unpublished report, Université' de Lille I, Lille, France, 1984.
12. Dershowitz, N., Hsiang, J., Josephson, N. A., and Plaisted, D. A. “Associative-commutative rewriting”. Proceedings of the Eighth International Joint Conférence on Artificial Intelligence, Karlsruhe, West Germany (August 1983), pp. 940-944.
13. Dershowitz, N. “A note on simplification orderings”. Information Processing Letters, Vol. 9, No. 5 (November 1979), pp. 212-215.
14. Q”, Unpublished note, Department Computer Science, University of Illinois, Urbana, IL, June 1980.
15. Dershowitz, N. “Termination of linear rewriting Systems”. Proceeiings of the Eighth EA TCS International Colloquium on Automate, Languages and Program-ming, Vol. 115, Acre, Israël (July 1981), pp. 448-458.
16. Dershowitz, N. “Orderings for term-rewriting Systems”. J. Theoretical Computer Science, Vol. 17, No. 3 (March 1982), pp. 279-301 (previous version appeared in Proceedings of the Symposium on Foundations of Computer Science, San Juan, PR, pp. 123-131 [October 1979]).
17. Dershowitz, N. “Well-founded orderings”, Technical Report ATR-83(8478)-3, Information Sciences Research Office, The Aerospace Corporation, El Segundo, CA, May 1983.
18. Dershowitz, N., and Manna, Z. “Proving termination with multiset orderings”. Communications of the ACM, Vol. 22, No. 8 (August 1979), pp. 465-476 (also in Proceedings of the International Colloquium on Automata, Languages and Programming, Graz, 188-202 [July 1979]).
19. Dershowitz, N., and Zaks, S. “Applied tree énumérations”. Proceedings of the Sixth Colloquium on Trees in Algebra and Programming, Vol. 112, Genoa, Italy (March 1981), pp. 180-193.
20. Detlefs, D., and Forgaard, R. “A procédure for automatically proving the termination of a set of rewrite rules”. Proceedings of the First International Conférence on Rewriting Techniques and Applications, Dijon, France (May 1985).
21. Ehrenfeucht, A., Haussier, D., and Rozenberg, G. “On regularity of context-free languages”. Theoretical Computer Science, Vol. 27 (1983), pp. 31132.
22. Feferman, S. “Systems of predicative analysis II: Représentation of ordinals”. J. Sgmbolic Logic, Vol. 33 (1968), pp. 193-220.
23. Filman, R. E. “personal communication”, 1978.
24. Forgaard, R. “A program for generating and analyzing term rewriting systems”, Master’s thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, September 1984.
25. Gardner, M. “Mathematical games: Tasks you cannot help fmishing no matter how hard you try to block fmishing them". Scientific American, Vol. 24, No. 2 (August 1983), pp. 12-21.
26. Gentzen, G. “New version of the consistency proof for elementary number theory”. In: Collected Papers of Gerhard Gentzen, M. E. Szabo, ed (1938). North-Holland, 1969, pp. 252-286 (1938).
27. Gnaedig, I. “personal communication”, 1985.
28. Gorn, S. “Handling the growth by définition of mechanical languages”. Proceedings of the Spring Joint Computer Conférence (Spring 1967), pp. 213-224.
29. Gorn, S. “On the conclusive validation of symbol manipulation processes (How do you know it has to work?)”. J. of the Franklin Institute, Vol. 296, No. 6 (December 1973), pp. 499-518.
30. Guttag, J. V., Kapur, D., and Musser, D. R. “On proving uniform termina-tion and restricted termination of rewriting Systems”. SIAM Computing, Vol. 12, No. 1 (February 1983), pp. 189-214.
31. Higman, G. “Ordering by divisibility in abstract algebras”. Proceedings of the London Mathematical Society (S), Vol. 2, No. 7 (September 1952), pp. 326-336.
32. Huet, G. “Confluent réductions: Abstract properties and applications to term rewriting systems”. J. of the Association for Computing Machinery, Vol. 27, No. 4 (1980), pp. 797-821 (previous version in Proceedinp of the Symposium on Foundations of Computer Science, Providence, RI, pp. 30-45 [1977]).
33. Huet, G., and Lankford, D. S. “On the uniform halting problem for term rewriting systems”, Rapport Laboria 283, IRLA, March 1978.
34. Huet, G., and Levy, J. J. “Call by need computations in non-ambiguous linear term rewriting systems”, Rapport laboria 359, INRIA, Le Chesnay, France, August 1979.
35. Huet, G., and Oppen, D. C. “Equations and rewrite rules: A survey”. In: Formai Language Theory: Perspectives and Open Problems, R. Book, ed. Académie Press, New York, 1980, pp. 349-405.
36. Hullot, J. M. “Canonical forms and unification”. Proceedings of the Fifth Conférence on Automated Déduction, Les Arcs, France (July 1980), pp. 318-334.
37. Iturriaga, R. “Contributions to mechanical mathematics”, Ph.D. Thesis, Carnegie-Mellon University, Pittsburgh, Pennsylvania, 1967.
38. Jouannaud, J. P., Lescanne, P., and Reinig, F. “Recursive décomposition ordering”. Proceedings of the Second IFIP Workshop on Formai Description of Programming Concepts, Garmiseh-Partenkirchen, West Germany (June 1982), pp. 331-348.
39. Jouannaud, J. P., and Kirchner, H. “Construction d’un plus petit order de simplification”, Unpublished note, Centre de Recherche en Informatique de Nancy, Nancy, France, 1982.
40. Jouannaud, J. P., and Munoz, M. “Termination of a set of rules modulo a set of équations". Proceedings of the Seventh International Conférence on Automated Déduction, Napa, CA (May 1984), pp. 175-193.
41. Kamin, S., and Levy, J. J. “Two généralisations of the recursive path ordering”, Unpublished note, Department of Computer Science, University of Illinois, Urbana, IL, February 1980.
42. Kapur, D., Narendran, P., and Sivakumar, G. “A path ordering for proving termination of term rewriting Systems”. Proceedings of the Tenth Colloquium on Trees in Algebra and Programming (1985).
43. Kapur, D., and Sivakumar, G. “Experiments with and architecture of RRL, a rewrite rule laboratory”. Proceedings of an NSF Workshop on the Rewrite Rule Laboratory, chenectady, NY (September 1983), pp. 33-56 (avail-able as Report 84GEN008, General Electric Research and Development [April 1984]).
44. Kirby, L., and Paris, J. “Accessible independence results for Peano arith-metic”. Bulletin London Mathematical Society, Vol. 14 (1982), pp. 285-293.
45. Knuth, D. E. Fundamental algorithme. Addison-Wesley, Reading, MA, 1973 (second édition).
46. Knuth, D. E., and Bendix, P. B. “Simple word problems in universal alge-bras”. In: Computational Problems in Abstract Algebra, J. Leech, ed. Pergamon Press, 1970, pp. 263-297.
47. Krishnamoorthy, M. S., and Narendran, P. “A note on recursive path ordering”, Unpublished note, General Electric Corporate Research and Development, Schenectady, NY, 1984.
48. Kruskal, J. B. “Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture”. Transactions of the American Mathematical Society, Vol. 95 (May 1960), pp. 210-225.
49. Kruskal, J. B. “The theory of well-quasi-ordering: A frequently discovered concept”. J. Combinatorial Theory Ser. A, Vol. 13 (1972), pp. 297-305.
50. Lankford, D. S. “Canonical algebraic simplification in computational logic”, Mémo ATP-25, Automatic Theorem Proving Project, University of Texas, Aus-tin, TX, May 1975.
51. Lankford, D. S. “On proving term rewriting systems are Noetherian”, Mémo MTP-3, Mathematics Department, Louisiana Tech. University, Ruston, LA, May 1979.
52. Lankford, D. S., and Musser, D. R. “A finite termination criterion”, Unpublished draft, 1981.
53. Laver, R. “Better-qu asi-ord er ings and a class of trees”. Studies in Foundations and Combinatorics (1978), pp. 31-48.
54. Lescanne, P. “Two implémentations of the recursive path ordering on monadic terms”. Proceedings of the Nineteenth Allerton Conférence on Communication, Control, and Computing, Monticello, IL (September 1981), pp. 634-643.
55. Lescanne, P. “Computer experiments with the REVE term rewriting system gen-erator”. Proceedings of the Tenth Symposium on Principles of Programming Languages, Austin, TX (January 1983), pp. 99-108.
56. Lescanne, P. “Some properties of décomposition ordering, A simplification ordering to prove termination of rewriting systems”. RAIRO Theoretical Informat-ics, Vol. 16, No. 4, pp. 331-347.
57. Lescanne, P. “Uniform termination of term-rewriting systems with status”. Proceedings of the Ninth Colloquium on Trees in Algebra and Programming, Bordeaux, France (March 1984).
58. Lescanne, P., and Jouannaud, J. P. “On multiset orderings”. Information Processing Lett., Vol. 15, No. 2 (September 1982), pp. 57-62.
59. Lescanne, P., and Steyaert, J. M. “On the study of data structures: Binary tournaments with repeated keys”. Proceedings of the Tenth EATCS International Colloquium on Automata, Languages and Programming, Barcelona, Spain (July 1983), pp. 466-475.
60. Levy, J. J. “Problem 80-5”. J. of Algorithms, Vol. 1, No. 1 (March 1980), pp. 108-109.
61. Lipton, R., and Snyder, L. “On the halting of tree replacement systems”. Proceedings of the Conférence on Theoretical Computer Science, Waterloo, Canada (August 1977), pp. 43-46.
62. Manna, Z. “Termination of algorithms”, Ph.D. thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA, April 1969.
63. Manna, Z. Mathematical Theory of Computation. McGraw-Hill, New York, 1974.
64. Manna, Z., and Ness, S. “On the termination of Markov algorithms”. Proceedings of the Third Hawaii International Conférence on System Science, Honolulu, HI (January 1970), pp. 789-792.
65. Metivier, Y. “About the rewriting Systems produced by the Knuth-Bendix com-pletion algorithm”. Information Processing Letters, Vol. 16 (January 1983), pp. 31-34.
66. Nash-Williams, C. S. J. A. “On well-quasi-ordering finite trees”. Proceedings of the Cambridge Philosophical Society, 59 (1963), pp. 833-835.
67. O’Donnell, M. J. “Computing in Systems described by équations”. Lecture Notes in Computer Science, Vol. 58, Berlin (1977).
68. Paulson, L. C. “Constructing reeursion opérations in intuitionistic type theory”, Technical Report 57, Computer Laboratory, University of Cambridge, Cambridge, UK, October 1984.
69. Pettorossi, A. “A property which guarantees termination in weak combinatory logic and subtree replacement systems”, Report R.78-23, Instituto di Automa-tica, Università di Roma, Rome, Italy, November 1978.
70. Pettorossi, A. “Comparing and putting together recursive path orderings, simplification orderings and non-ascending property for termination proofs of term rewriting Systems”. Proceedings of the Eighth International Colloquium on Automata, Languages and Programming, Acre, Israël (July 1981), pp. 432-447.
71. Plaisted, D. A. “Well-founded orderings for proving termination of Systems of rewrite rules”, Report R78-932, Department of Computer Science, University of Illinois, Urbana, IL, July 1978.
72. Plaisted, D. A. "A recursively defined ordering for proving termination of term rewriting systems”, Report R-78-943, Department of Computer Science, University of Illinois, Urbana, IL, September 1978.
73. Plaisted, D. A. “personal communication”, 1979.
74. Plaisted, D. A. “An associative path ordering”. Proceedings of an NSF Workshop on the Rewrite Rule Laboratory, Schenectady, NY (September 1983), pp. 123-136 (available as Report 84GEN008, General Electric Research and Development [April 1984]).
75. Plaisted, D. A. “The undecidability of self embedding for term rewriting Systems”. Information Processing Lett., Vol. 20, No. 2 (February 1985), pp. 61-64.
76. Porat, S., and Francez, N. “Fairness in term rewriting systems”
77. Puel, L. “personal communication”, May 1985.
78. Raoult, J. C., and Vuillemin, J. “Operational and semantic équivalence between recursive programs”. J. of the Association of Computing Machinery, Vol. 27, No. 4 (October 1980), pp. 772-796.
79. Rosen, B. ‘‘Tree-manipulating systems and Church-Rosser theorems”. J. of the Association for Computing Machinery, Vol. 20 (1973), pp. 160-187.
80. Rusinowitch, M. “Plaisted ordering and recursive décomposition ordering revisited”. Proceedings of the First International Conférence on Rewriting Techniques and Applications, Dijon, France (May 1985).
81. Sakai, K. “An ordering method for term rewriting systems”. Proceedings of the First International Conférence on Fifth Génération Computer Systems, Tokyo, Japan (November 1984).
82. Scherlis, W. L. “Expression procédures and propam dérivation”, Ph.D. Dissertation, Department Computer Science, Stanford University, Stanford, CA, August 1980.
83. Slagle, J. R. “Automated theorem-proving for théories with simplifiers, commuta-tivity, and associativity”. J. of the Association for Computing Machinery, Vol. 21, No. 4 (1974), pp. 622-642.
84. Smullyan, R. M. “Trees and bail games”. Annals of the New York Academy of • Science, Vol. 321 (1979), pp. 86-90.
85. Tarski, A. A Décision Method for Elementary Algebra and Geometry. University of California Press, Berkeley, CA, 1951.
86. Veblen, O. “Continuous increasing functions of finite and transfinite ordinals”. Transactions of the American Mathematical Society, Vol. 9 (1908), pp. 280-292.
87. Weyhrauch, R. W. “Some notes on ordinals up to Tq’, Informai note 13, Stanford University, Stanford, CA, March 1978.