Theoretical Computer Science, Volume 87

Volume 87, Number 1, 1991

Viggo Stoltenberg-Hansen, J. V. Tucker: Algebraic and Fixed Point Equations over Inverse Limits of Algebras. 1-24
William M. Farmer: Simple Second-order Languages for which Unification is Undecidable. 25-41
A. G. Heibig: Control Machines: A New Model of Parallelism for Compositional Specifications and Their Effective Compilation. 43-80
Herman Balsters, Maarten M. Fokkinga: Subtyping Can Have a Simple Semantics. 81-96
Reine Fournier, Gregor von Bochmann: The Equivalence in the DCP Model. 97-114
Lars Hallnäs: Partial Inductive Definitions. 115-142
Paul H. B. Gardiner, Carroll Morgan: Data Refinement of Predicate Transformers. 143-162
Hans Zierer: Relation Algebraic Domain Constructions. 163-188
A. Wilm: Determinism and Non-determinism in PDL. 189-202
Mohamed Mezghiche: Weak Completeness of Type Assignment in lambda-Calculus Models: A Generalization of Hindley's Result. 203-208
Robin Milner, Mads Tofte: Co-Induction in Relational Semantics. 209-220
William McCune, Larry Wos: The Absence and the Presence of Fixed Point Combinators. 221-228

Zoltán Ésik: Results on Homomorphic Realization of Automata by alpha_0-Products. 229-249
Krzysztof Diks, Wojciech Rytter: On Optimal Parallel Computations for Sequences of Brackets. 251-262
Marc Gyssens, Dirk Van Gucht: A Comparison between Algebraic Query Languages for Flat and Nested Databases. 263-286
Erzsébet Csuhaj-Varjú, Jürgen Dassow: On Bounded Interpretations of Grammar Forms. 287-313
Aldo de Luca, Stefano Varricchio: Finiteness and Iteration Conditions for Semigroups. 315-327
Nalinakshi Nirmal, Raghavan Rama: Machine Characterization of (E0L-E0L) Array Languages. 329-346
Cristian Calude: Relativized Topological Size of Sets of Partial Recursive Functions. 347-352