Author： Krishna Rao M.R.K.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.208, Iss.1, 1998-11, pp. : 59-86
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
Implementing conditional term rewriting by graph rewriting
By Ohlebusch E.
Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. :
Access to resources
Recommend
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. :
Modularity in noncopying term rewriting
Theoretical Computer Science, Vol. 152, Iss. 1, 1995-12 ,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. :