Theoretical Computer Science, Volume 260

Volume 260, Number 1-2, 6 June 2001

• Bart Jacobs, Larry Moss, Horst Reichel, Jan J. M. M. Rutten:
  Foreword : Coalgebraic Methods in Computer Science 1998. 1
  
• Corina Cîrstea:
  Semantic constructions for the specification of objects. 3-25
  
• Andrea Corradini, Martin Große-Rhode, Reiko Heckel:
  A Coalgebraic presentation of structured transition systems. 27-55
  
• H. Peter Gumm:
  Equational and implicational classes of coalgebras. 57-69
  
• H. Peter Gumm, Tobias Schröder:
  Covarieties and complete covarieties. 71-86
  
• Peter Johnstone, John Power, Toru Tsujishita, Hiroshi Watanabe, James Worrell:
  On the structure of categories of coalgebras. 87-117
  
• Alexander Kurz:
  Specifying coalgebras with modal logic. 119-138
  
• Lawrence S. Moss:
  Parametric corecursion. 139-163
  
• Alberto Pardo:
  Fusion of recursive programs with computational effects. 165-207
  
• Martin Rö:
  From modal logic to terminal coalgebras. 209-228
  
• Grigore Rosu:
  Equational axiomatizability for coalgebra. 229-247