Journals in DBLP

Theor. Comput. Sci.
2006, volume: 366, number: 1-2

1. José Luiz Fiadeiro, Jan J. M. M. Rutten
   Preface. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:366, n:1-2, pp:1-2 [Journal]
   
2. Stefan Milius, Lawrence S. Moss
   The category-theoretic solution of recursive program schemes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:366, n:1-2, pp:3-59 [Journal]
   
3. Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Sumit Nain
   Bisimilarity is not finitely based over BPA with interrupt. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:366, n:1-2, pp:60-81 [Journal]
   
4. Jirí Adámek
   The intersection of algebra and coalgebra. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:366, n:1-2, pp:82-97 [Journal]
   
5. Roberto Bruni, Ivan Lanese, Ugo Montanari
   A basic algebra of stateless connectors. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:366, n:1-2, pp:98-120 [Journal]
   
6. Daniel Hausmann, Till Mossakowski, Lutz Schröder
   A coalgebraic approach to the semantics of the ambient calculus. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:366, n:1-2, pp:121-143 [Journal]
   
7. Martin Hyland, John Power
   Discrete Lawvere theories and computational effects. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:366, n:1-2, pp:144-162 [Journal]
   
8. Prasanna Thati, José Meseguer
   Complete symbolic reachability analysis using back-and-forth narrowing. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:366, n:1-2, pp:163-179 [Journal]