Type introduction for equational rewriting

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

Volumn 1234, Issue , 1997, Pages 283-293

  Ohsaki, Hitoshi ^a   Middeldorp, Aart ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ACYCLICITY; PERSISTENT PROPERTIES; REWRITE SYSTEMS; UNDECIDABILITY;

ARTIFICIAL INTELLIGENCE;

EID: 84947917909     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63045-7_29     Document Type: Conference Paper

References (16)

1. N. Dershowitz, Termination of Rewriting, Journal of Symbolic Computation 3 (1987) 69-116.
2. N. Dershowitz and J.-P. Jouannaud, Rewrite Systems, in: Handbook of Theoretical Computer Science, Vol. B (ed. J. vein Leeuwen), North-Holland (1990) 243-320
3. N. Dershowitz and Z. Manna, Proving Termination with Multiset Orderings, Communications of the ACM 22 (1979) 465-476.
4. M.C.F. Ferreira, Dummy Elimination in Equational Rewriting, Proc. 7th RTA, New Brunswick, LNCS 1103 (1996) 78-92.
5. M.C.F. Ferreira and H. Zantema, Dummy Elimination: Making Termination Easier, Proc. 10th FCT, Dresden, LNCS 965 (1995) 243-252.
6. A. Geser, A. Middeldorp, E. Ohlebusch, and H. Zantema, Relative Undecidability in Term Rewriting, Proc. CSL, Utrecht, LNCS (1996). To appear. Available at http://ww.score.is.tsukuba.ac.jp/~ami/papers/csl96.dvi.
7. J.-P. Jouannaud and M. Muñoz, Termination of a Set of Rules Modulo a Set of Equations, Proc. 7th CADE, Napa, LNCS 170 (1984) 175-193.
8. D. Kapur and G. Sivakumar, A Total, Ground Path Ordering for Proving Termination of AC-Rewrite Systems, Proc. 8th RTA, Sitges, LNCS (1997). To appear.
9. J.W. Klop, Term Rewriting Systems, in: Handbook of Logic in Computer Science, Vol. 2 (eds. S. Abramsky, D. Gabbay and T. Maibaum), Oxford University Press (1992) 1-116.
10. A. Middeldorp and B. Gramlich, Simple Termination is Difficult, Applicable Algebra in Engineering, Communication and Computing 6 (1995) 115-128.
11. E. Ohlebusch, A Simple Proof of Sufficient Conditions for the Termination of the Disjoint Union of Term Rewriting Systems, Bulletin of the EATCS 49 (1993) 178183.
12. J. vein de Pol, Modularity in Many-Sorted Term Rewriting Systems, Master’s thesis, report INF/SCR-92-37, Utrecht University (1992).
13. A. Rubio and R. Nieuwenhuis, A Total AC-Compatible Ordering Based on RPO, Theoretical Computer Science 142 (1995) 209-227.
14. J. Steinbach, Termination of Rewriting: Extensions, Comparison and Automatic Generation of Simpliñcation Orderings, Ph.D. thesis, Universität Kaiserslautern (1994).
15. H. Zantema, Termination of Term Rewriting: Interpretation and Type Elimination, Joumeil of Symbolic Computation 17 (1994) 23-50.
16. H. Zantema and A. Geser, Non-Looping Rewriting, report UU-CS-1996-03, Utrecht University, Department of Computer Science (1996). Aveiilable at ftp: //ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1996/1996-03.ps.gz.