Journals in DBLP

Theor. Comput. Sci.
2001, volume: 260, number: 1-2

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