Theoretical Computer Science, Volume 170

Volume 170, Numbers 1-2, 15 December 1996

• Y. S. Ramakrishna, P. M. Melliar-Smith, Louise E. Moser, Laura K. Dillon, G. Kutty:
  Interval Logics and Their Decision Procedures. Part II: A Real-Time Interval Logic. 1-46
  
• Jan Friso Groote, M. P. A. Sellink:
  Confluence for Process Verification. 47-81
  
• Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Adolfo Piperno:
  Filter Models for Conjunctive-Disjunctive lambda-Calculi. 83-128
  
• Noriko H. Arai:
  Tractability of Cut-Free Gentzen Type Propositional Calculus with Permutation Inference. 129-144
  
• Mila E. Majster-Cederbaum, Christel Baier:
  Metric Completion versus Ideal Completion. 145-171
  
• Franco Barbanera, Maribel Fernández:
  Intersection Type Assignment Systems with Higher-Order Algebraic Rewriting. 173-207
  
• Yannis Dimopoulos, Alberto Torres:
  Graph Theoretical Structures in Logic Programs and Default Theories. 209-244
  
• Adel Bouhoula:
  Using Induction and Rewriting to Verify and Complete Parameterized Specifications. 245-276
  
• Vladimiro Sassone:
  An Axiomatization of the Algebra of Petri Net Concatenable Processes. 277-296
  
• Vladimiro Sassone, Mogens Nielsen, Glynn Winskel:
  Models for Concurrency: Towards a Classification. 297-348
  
• Jan J. M. M. Rutten:
  Elements of Generalized Ultrametric Domain Theory. 349-381
  
• Jia-Huai You, Robert Cartwright, Ming Li:
  Iterative Belief Revision in Extended Logic Programming. 383-406
  
• Barney P. Hilken:
  Towards a Proof Theory of Rewriting: The Simply Typed 2lambda-Calculus. 407-444
  
• Hsu-Chun Yen, Shi-Tsuen Jian, Ta-Pang Lao:
  Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes. 445-464