Author： Esik Z. Bernatsky L.
Publisher： Elsevier
ISSN： 1571-0661
Source： Electronic Notes in Theoretical Computer Science, Vol.1, Iss.1, 2004-01, pp. : 1-28
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Previous Menu Next
Abstract
Related content
Access to resources
Recommend
An equational notion of lifting monad
By Bucalo A. Fuhrmann C. Simpson A.
Theoretical Computer Science, Vol. 294, Iss. 1, 2003-02 ,pp. :
Equational axiomatizability for coalgebra
By Rosu
Theoretical Computer Science, Vol. 260, Iss. 1, 2001-06 ,pp. :
Equational rules for rewriting logic
By Viry P.
Theoretical Computer Science, Vol. 285, Iss. 2, 2002-08 ,pp. :
Equational and implicational classes of coalgebras
By Gumm H.P.
Theoretical Computer Science, Vol. 260, Iss. 1, 2001-06 ,pp. :