Theoretical Computer Science, Volume 75

Volume 75, Number 1&2, 1990

• Robin Milner: Interpreting one Concurrent Calculus in Another. 3-13 BibTeX
• J. W. de Bakker, Joost N. Kok: Comparative Metric Semantics for Concurrent Prolog. 14-43 BibTeX
• Moreno Falaschi, Giorgio Levi: Finite Failures and Partial Computations in Concurrent Logic Languages. 45-66 BibTeX
• Masaki Murakami: A Declarative Semantics of Flat Guarded Horn Clauses for Programs with Perpetual Processes. 67-83 BibTeX
• Steffen Hölldobler: Conditional Equational Theories and Complete Sets of Transformations. 85-110 BibTeX
• Nachum Dershowitz, Mitsuhiro Okada: A Rationale for Conditional Equational Programming. 111-138 BibTeX
• Tadashi Kawamura, Tadashi Kanamori: Preservation of Stronger Equivalence in Unfold/Fold Logic Program Transformation. 139-156 BibTeX
• Philippe Devienne: Weighted Graphs: A Tool for Studying the Halting Problem and Time Complexity in Term Rewriting Systems and Logic Programming. 157-215 BibTeX

Volume 75, Number 3, 1990

• Pierpaolo Degano, Rocco De Nicola, Ugo Montanari: A Partial Ordering Semantics for CCS. 223-262 BibTeX
• Shmuel Katz, Doron Peled: Interleaving Set Temporal Logic. 263-287 BibTeX
• Manfred Droste, Rüdiger Göbel: Non-Deterministic Information Systems and their Domains. 289-309 BibTeX
• Uri Blass, Aviezri S. Fraenkel: The Sprague-Grundy Function for Wythoff's Game. 311-333 BibTeX
• Eric Allender, Christopher B. Wilson: Downward Translations of Equality. 335-346 BibTeX
• Jianzhong Du, Joseph Y.-T. Leung, Gilbert H. Young: Minimizing Mean Flow Time with Release Time Constraint. 347-355 BibTeX
• Thomas Lengauer, Klaus W. Wagner: The Binary Network Flow Problem is Logspace Complete for P. 357-363 BibTeX