Dummy elimination in equational rewriting

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

Volumn 1103, Issue , 1996, Pages 78-92

  Ferreira, M C F ^a,b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSIDADE NOVA DE LISBOA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

EQUATIONAL THEORY; FUNCTION SYMBOLS; PROCESS ALGEBRAS; REWRITE RULES; REWRITE SYSTEMS; REWRITING MODULO; TERM REWRITING;

ARTIFICIAL INTELLIGENCE;

EID: 84956991064     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61464-8_44     Document Type: Conference Paper

References (14)

1. F. Bellegarde and P. Lescanne. Termination by completion. Applicable Algebra in Engineering, Communication and Computing, 1(2):79-96, 1990.
2. 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, 1990.
3. N. Dershowitz and Z. Manna. Proving termination with multiset orderings. Communications ACM, 22(8):465-476, 1979.
4. M. C. F. Ferreira. Termination of Term Rewriting - Wellfoundedness, totality and transformations. PhD thesis, Universiteit Utrecht, November 1995.
5. M. C. F. Ferreira and H. Zantema. Dummy elimination: making termination easier. In H. Reichel, editor, Fundamentals of Computation Theory, 10th International Conference FCT'95, volume 965 of Lecture Notes in Computer Science, pages 243- 252. Springer, 1995. Appeared also as technical report UU-CS-1994-47, University of Utrecht, October 1994.
6. W. J. Fokkink and H. Zantema. Prefix iteration in basic process algebra: applying termination techniques. In C. V. A. Ponse and S. F. M. van Vlijmen, editors, Proceedings of the second workshop on Algebra of Communicating Processes, ACP 95, volume 95-14 of Computing Science Reports, pages 139-156. Department of Mathematics and Computing Science, Eindhoven University of Technology, 1995.
7. A. Geser. Relative termination. PhD thesis, Universitãt Passau, 1990. Also available as: Report 91-03, Ulmer Informatik-Berichte, Universitãt Ulm, 1991.
8. J.-P. Jouannaud and M. Muñoz. Termination of a set of rules modulo a set of equations. In Proceedings of the seventh International Conference onAutomated Deduction, volume 170 of Lecture Notes in Computer Science, pages 175 - 193. Springer, Napa, CA, 1984.
9. J. W. Klop. Term rewriting systems. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume II, pages 1-116. Oxford University Press, 1992.
10. D. A. Plaisted. Equational reasoning and term rewriting systems. In D. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 1 - Logical Foundations, pages 273-364. Oxford Science Publications, Clarendon Press - Oxford, 1993.
11. J. Steinbach. Termination of Rewriting - Extension, Comparison and Automatic Generation of Simplification Orderings. PhD thesis, University of Kaiserslautern, 1994.
12. H. Zantema. Termination of term rewriting: interpretation and type elimination. Journal of Symbolic Computation, 17:23-50, 1994.
13. H. Zantema. Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24:89-105, 1995. Appeared also as technical report RUU-CS-93-24, Utrecht University, July 1993.
14. s. In J. Hsiang, editor, Proceedings of the 6th Conference on Rewriting Techniques and Applications, volume 914 of Lecture Notes in Computer Science, pages 41-55. Springer, 1995. Appeared as report UU-CS-1994-44, Utrecht University.