Theoretical Computer Science, Volume 238

Volume 238, Numbers 1-2, 6 May 2000

• Viktor K. Sabelfeld:
  The tree equivalence of linear recursion schemes. 1-29
  
• Prakash Panangaden, Clark Verbrugge:
  Generating irregular partitionable data structures. 31-80
  
• Markus Roggenbach, Mila E. Majster-Cederbaum:
  Towards a unified view of bisimulation: a comparative study. 81-130
  
• Michael Codish, Vitaly Lagoon:
  Type dependencies for logic programs using ACI-unification. 131-159
  
• Ludwik Czaja:
  Process languages and nets. 161-181
  
• Delia Kesner:
  Confluence of extensional and non-extensional lambda-calculi with explicit substitutions. 183-220
  
• Giuliano Pacini, Maria I. Sessa:
  Loop checking in SLD-derivations by well-quasi-ordering of goals. 221-246
  
• Sándor Vágvölgyi:
  Congruential complements of ground term rewrite systems. 247-274
  
• Wim H. Hesselink, Albert Thijs:
  Fixpoint semantics and simulation. 275-311
  
• Michele Boreale, Luca Trevisan:
  A complexity analysis of bisimilarity for value-passing processes. 313-345
  
• Petr Savický, Stanislav Zák:
  A read-once lower bound and a (1, +k)-hierarchy for branching programs. 347-362
  
• Ines Margaria, Maddalena Zacchi:
  Generalized filter models. 363-387
  
• Rocco De Nicola, Rosario Pugliese:
  Linda-based applicative and imperative process algebras. 389-437
  
• Joost-Pieter Katoen, Albert Nymeyer:
  Pattern-matching algorithms based on term rewrite systems. 439-464
  
• Mingsheng Ying:
  Weak confluence and tau-inertness. 465-475
  
• Noriko H. Arai:
  No feasible monotone interpolation for simple combinatorial reasoning. 477-482
  
• Holger Naundorf:
  Strictly causal functions have a unique fixed point. 483-488
  
• Philippe Besnard, Torsten Schaub:
  What is a (non-constructive) non-monotone logical system? 489-494
  
• Petr Savický, Jiri Sgall:
  DNF tautologies with a limited number of occurrences of every variable. 495-498