Author： Weiermann A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.139, Iss.1, 1995-03, pp. : 355-362
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Modular proofs for completeness of hierarchical term rewriting systems
By Rao M.R.K.K.
Theoretical Computer Science, Vol. 151, Iss. 2, 1995-11 ,pp. :
Access to resources
Recommend
The first-order theory of lexicographic path orderings is undecidable
Theoretical Computer Science, Vol. 176, Iss. 1, 1997-04 ,pp. :
Modular Termination Proofs for Rewriting Using Dependency Pairs
By Giesl J. Arts T. Ohlebusch E.
Journal of Symbolic Computation, Vol. 34, Iss. 1, 2002-07 ,pp. :
Termination of term rewriting using dependency pairs
Theoretical Computer Science, Vol. 236, Iss. 1, 2000-04 ,pp. :