Author： Lammel R.
Publisher： Elsevier
ISSN： 1567-8326
Source： Journal of Logic and Algebraic Programming, Vol.54, Iss.1, 2003-01, pp. : 1-64
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Towards a proof theory of rewriting: the simply typed 2 -calculus
By Hilken B.P.
Theoretical Computer Science, Vol. 170, Iss. 1, 1996-12 ,pp. :
Access to resources
Recommend
Reflection and Strategies in Rewriting Logic
Electronic Notes in Theoretical Computer Science, Vol. 4, Iss. 1, 2004-01 ,pp. :
A Logic for Rewriting Strategies
Electronic Notes in Theoretical Computer Science, Vol. 58, Iss. 2, 2004-01 ,pp. :
Modularity in noncopying term rewriting
Theoretical Computer Science, Vol. 152, Iss. 1, 1995-12 ,pp. :
Implementing conditional term rewriting by graph rewriting
By Ohlebusch E.
Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. :