Theoretical Computer Science, Volume 124

Volume 124, Number 1, 14 February 1994

Mila E. Majster-Cederbaum, F. Zetzsche: The Comparison of a CPO-based Semantics with a CMS-based semantics for CSP. 1-40
Béatrice Bérard: Global Serializability of Concurrent Programs. 41-70
Susumu Yamasaki: A Denotational Semantics and Dataflow Construction for Logic Programs. 71-91
Michael Codish, Dennis Dams, Eyal Yardeni: Bottom-up Abstract Interpretation of Logic Programs. 93-125
Satish R. Thatte: Type Inference with Partial Types. 127-148
Jan A. Bergstra, Jan Heering: Which Data Types have omega-complete Initial Algebra Specifications? 149-168
Ursula Goltz, Arend Rensink: Finite Petri Nets as Models for Recursive Causal Behaviour. 169-179
Kees Doets: Left Termination Turned into Termination. 180-187
Michael Barr: Additions and Corrections to ``Terminal Coalgebras in Well-founded Set Theory''. 189-192

Andrew M. Pitts: A co-Induction Principle for Recursively Defined Domains. 195-219
Malika More: Investigation of Binary Spectra by Explicit Polynomial Transformations of Graphs. 221-272
Wim H. Hesselink: Nondeterminacy and Recursion via Stacks and Games. 273-295
Annalisa Bossi, Nicoletta Cocco, Massimo Fabris: Norms on Terms and their use in Proving Universal Termination of a Logic Program. 297-328
Jung-Heum Park, Kyung-Yong Chwa: On the Construction of Regular Minimal Broadcast Digraphs. 329-342
Jean-Jacques Hébrard: A Linear Algorithm for Renaming a Set of Clauses as a Horn Set. 343-350