Author： Gramlich B.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.165, Iss.1, 1996-09, pp. : 97-131
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
Transformations and confluence for rewrite systems
By Verma R.M.
Theoretical Computer Science, Vol. 152, Iss. 2, 1995-12 ,pp. :
Access to resources
Recommend
Simple termination of rewrite systems
Theoretical Computer Science, Vol. 175, Iss. 1, 1997-03 ,pp. :
Logicality of conditional rewrite systems
By Yamada T. Avenhaus J. Lora-Saenz C. Middeldorp A.
Theoretical Computer Science, Vol. 236, Iss. 1, 2000-04 ,pp. :
Higher-order rewrite systems and their confluence
Theoretical Computer Science, Vol. 192, Iss. 1, 1998-02 ,pp. :
Journal of Symbolic Computation, Vol. 22, Iss. 3, 1996-03 ,pp. :