Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Science Applications,Hardware and Architecture,Theoretical Computer Science,Software
Reference15 articles.
1. Heut G, Lankford D S. On the uniform halting problem for term rewriting systems. Technical Report 283, Laboria, France, 1978.
2. Middeldorp A, Zantema H. Simple termination of rewrite systems. Theoretical Computer Science, 1997, 175: 127–158.
3. Toyama Y. How to prove equivalence of term rewriting systems without induction. Theoretical Computer Science, 1991, 90: 369–390.
4. Feng S. An inductive proving method for weakly ground termination of term rewriting systems. Computer Science, 2001, 28(7): 105–108. (in Chinese)
5. Zhang H, Kapur K, Krishnamoorthy M S. A mechanizable induction principle for equational specification. In Proc. 9th Int. Conf. Automated Deduction at Argonne, Illinois, USA, Lecture Notes in Computer Science 310, May 1988, pp.162–181.