Author： Bucalo A. Fuhrmann C. Simpson A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.294, Iss.1, 2003-02, pp. : 31-60
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
By Kobayashi S.
Theoretical Computer Science, Vol. 175, Iss. 1, 1997-03 ,pp. :
Access to resources
Recommend
Combining a monad and a comonad
By Power
Theoretical Computer Science, Vol. 280, Iss. 1, 2002-05 ,pp. :
Scott Induction and Equational Proofs
Electronic Notes in Theoretical Computer Science, Vol. 1, Iss. 1, 2004-01 ,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. :