Author： Kennaway R. Klop J.W. Sleep R. de Vries F.J.
Publisher： Academic Press
ISSN： 0747-7171
Source： Journal of Symbolic Computation, Vol.21, Iss.1, 1996-01, pp. : 15-39
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
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
Theoretical Computer Science, Vol. 285, Iss. 2, 2002-08 ,pp. :
Access to resources
Recommend
Electronic Notes in Theoretical Computer Science, Vol. 4, Iss. 1, 2004-01 ,pp. :
Controlling Rewriting by Rewriting
By Borovansky P. Kirchner C. Kirchner H.
Electronic Notes in Theoretical Computer Science, Vol. 4, Iss. 1, 2004-01 ,pp. :
Normalized Rewriting: an Alternative to Rewriting modulo a Set of Equations
By Marche C.
Journal of Symbolic Computation, Vol. 21, Iss. 3, 1996-03 ,pp. :
Implementing conditional term rewriting by graph rewriting
By Ohlebusch E.
Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. :