Theoretical Computer Science, Volume 318

Volume 318, Number 1-2, 6 June 2004

• Jean-Yves Marion:
  Editorial: Implicit Computational Complexity. 1
  
• Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg:
  An arithmetic for non-size-increasing polynomial-time computation. 3-27
  
• Patrick Baillot:
  Stratified coherence spaces: a denotational semantics for light linear logic. 29-55
  
• S. Bellantoni, Isabel Oitavem:
  Separating NC along the delta axis. 57-78
  
• Ralph Benzinger:
  Automated higher-order complexity analysis. 79-103
  
• Norman Danner, Chris Pollett:
  Minimization and NP multifunctions. 105-119
  
• Martin Hofmann, Philip J. Scott:
  Realizability models for BLL-like languages. 121-137
  
• Lars Kristiansen, Karl-Heinz Niggl:
  On the computational complexity of imperative programming languages. 139-161
  
• Yves Lafont:
  Soft linear logic and polynomial time. 163-180
  
• Daniel Leivant:
  Intrinsic reasoning about functional programs II: unipolar induction and primitive-recursion. 181-196
  
• Andrzej S. Murawski, C.-H. Luke Ong:
  On an interpretation of safe recursion in light affine logic. 197-223
  
• James S. Royer:
  On the computational complexity of Longley's H functional. 225-241
  

Volume 318, Number 3, 8 June 2004

• Mila E. Majster-Cederbaum, Frank Salger:
  Towards the hierarchical verification of reactive systems. 243-296
  
• Rajeev Alur, Salvatore La Torre, George J. Pappas:
  Optimal paths in weighted timed automata. 297-322
  
• Josee Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden:
  Metrics for labelled Markov processes. 323-354
  
• Georg Karner:
  Continuous monoids and semirings. 355-372
  
• Sabine Broda, Luís Damas, Marcelo Finger, Paulo Silva e Silva:
  The decidability of a fragment of BB'IW-logic. 373-408
  
• Ugo Dal Lago, Simone Martini:
  Phase semantics and decidability of elementary affine logic. 409-433
  
• Robin N. Banerjee, Andrés Bujosa:
  A geometric interpretation of LD-resolution. 435-470