Theoretical Computer Science, Volume 258

Volume 258, Number 1-2, 6 May 2001

• Franck van Breugel:
  An introduction to metric semantics: operational and denotational models for programming and specification languages. 1-98
  
• Manfred Broy, Gheorghe Stefanescu:
  The algebra of stream processing functions. 99-129
  
• Joost Engelfriet, Tjalling Gelsema:
  Structural inclusion in the pi-calculus with replication. 131-168
  
• Ken Mano, Mizuhito Ogawa:
  Unique normal form property of compatible term rewriting systems: a new proof of Chew's theorem. 169-208
  
• Athanassios Tzouvaras:
  Objects and their lambda calculus. 209-232
  
• Gaétan Hains, Frédéric Loulergue, John Mullins:
  Concrete data structures and functional parallel programming. 233-267
  
• Giorgio Delzanno, Maurizio Martelli:
  Proofs as computations in linear logic. 269-297
  
• Lars Birkedal, Mads Tofte:
  A constraint-based region inference algorithm. 299-392
  
• Flavio Corradini, Dino Di Cola:
  On testing urgency through laziness over processes with durational actions. 393-407
  
• Petr Jancar, Antonín Kucera, Richard Mayr:
  Deciding bisimulation-like equivalences with finite-state processes. 409-433
  
• Bernhard Gramlich:
  On interreduction of semi-complete term rewriting systems. 435-451
  
• Franck Seynhaeve, Sophie Tison, Marc Tommasi, Ralf Treinen:
  Grid structures and undecidable constraint theories. 453-490
  
• E. Allen Emerson, Charanjit S. Jutla, A. Prasad Sistla:
  On model checking for the µ-calculus and its fragments. 491-522
  
• Stefan Brass, Jürgen Dix, Ilkka Niemelä, Teodor C. Przymusinski:
  On the equivalence of the static and disjunctive well-founded semantics and its computation. 523-553
  
• Shashi Shekhar, Weili Wu:
  Optimal placement of data replicas in distributed database with majority voting protocol. 555-571
  
• Philippe Darondeau:
  On the Petri net realization of context-free graphs. 573-598