Author： Bouhoula A. Jouannaud J.-P. Meseguer J.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.236, Iss.1, 2000-04, pp. : 35-132
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
Equational rules for rewriting logic
By Viry P.
Theoretical Computer Science, Vol. 285, Iss. 2, 2002-08 ,pp. :
Access to resources
Recommend
Recursion and corecursion have the same equational logic
By Moss L.S.
Theoretical Computer Science, Vol. 294, Iss. 1, 2003-02 ,pp. :
Incremental constraint satisfaction for equational logic programming
By Alpuente M. Falaschi M. Levi G.
Theoretical Computer Science, Vol. 142, Iss. 1, 1995-05 ,pp. :
On proof normalization in linear logic
By Perrier G.
Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. :