Theoretical Computer Science, Volume 192

Volume 192, Number 1, 10 Februrary 1998

• Richard Mayr, Tobias Nipkow:
  Higher-Order Rewrite Systems and Their Confluence. 3-29
  
• Massimo Marchiori:
  Bubbles in Modularity. 31-54
  
• Géraud Sénizergues:
  A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems. 55-75
  
• Siva Anantharaman, Gilles Richard:
  A Rewrite Mechanism for Logic Programs with Negation. 77-106
  
• Franz Baader, Klaus U. Schulz:
  Combination of Constraint Solvers for Free and Quasi-Free Structures. 107-161
  

Volume 192, Number 2, 20 Februrary 1998

• Roberto Gorrieri, Chris Hankin:
  Foreword: Theoretical Aspects of Coordination Languages. 163-165
  
• Nadia Busi, Roberto Gorrieri, Gianluigi Zavattaro:
  A Process Algebraic View of Linda Coordination Primitives. 167-199
  
• Laurent Dami:
  A Lambda-Calculus for Dynamic Binding. 201-231
  
• Chris Hankin, Daniel Le Métayer, David Sands:
  Refining Multiset Tranformers. 233-258
  
• Luís Monteiro, António Porto:
  Entailment-Based Actions for Coordination. 259-286
  
• Manibrata Mukherji, Dennis G. Kafura:
  A Process-Calculus-Based Abstraction for Coordinating Multi-Agent Groups. 287-314
  
• Peter Wegner:
  Interactive Foundations of Computing. 315-351
  

Last update Mon May 20 18:32:03 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page