Theoretical Computer Science, Volume 211

Volume 211, Numbers 1-2, 28 January 1999

• Maciej Koutny, Eike Best:
  Operational and Denotational Semantics for the Box Algebra. 1-83
  
• George M. Reed, A. W. Roscoe:
  The Timed Failures-Stability Model for CSP. 85-127
  
• Matthew Stone:
  Representing Scope in Intuitionistic Deductions. 129-188
  
• Yong Sun:
  An Algebraic Generalization of Frege Structures-Binding Algebras. 189-232
  
• A. S. Troelstra:
  From Constructivism to Computer Science. 233-252
  
• Rajeev Alur, Limor Fix, Thomas A. Henzinger:
  Event-Clock Automata: A Determinizable Class of Timed Automata. 253-273
  
• Marco Comini, Maria Chiara Meo:
  Compositionality Properties of SLD-Derivations. 275-309
  
• Joost Engelfriet, Tjalling Gelsema:
  Multisets and Structural Congruence of the pi-Calculus with Replication. 311-337
  
• Luca Aceto, Jan Friso Groote:
  A Complete Equational Axiomatization for MPA with String Iteration. 339-374
  
• Roel Bloo, Herman Geuvers:
  Explicit Substitution On the Edge of Strong Normalization. 375-395
  
• Chantal Berline, Klaus Grue:
  A kappa-Denotational Semantics for Map Theory in ZFC+SI. 397-398