Theoretical Computer Science, Volume 83

Volume 83, Number 1, 1991

Val Tannen, Jean H. Gallier: Polymorphic Rewriting Conserves Algebraic Strong Normalization. 3-28
Felice Cardone: Recursive Types for Fun. 29-56
Loïc Colson: About Primitive Recursive Algorithms. 57-69
Nachum Dershowitz, Stéphane Kaplan, David A. Plaisted: Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, . . . 71-96
Zohar Manna, Amir Pnueli: Completing the Temporal Picture. 91-130
Francesco Parisi-Presicce: Foundations of Rule-Based Design of Modular Systems. 131-155
Glynn Winskel: A Note on Model Checking the Modal nu-Calculus. 157-167

Horst Luckhardt: New Formally Undecidable Propositions: Non-Trivial Lower Bounds on Proof Complexity and Related Theorems. 169-188
David Mauro: Derived Linear Systems of Context-Free Grammars. 189-203
Martin J. M. de Boer, Aristid Lindenmayer, Zsolt Tuza: A Periodic Division Pattern that Cannot be Generated by D0L Systems. 205-218
Salah Labhalla: Complexité du Calcul du Développement d'un Nombre Réel en Fractions Continues. 219-235
Shigeko Seki, Youichi Kobuchi: On Standard Locally Catenative L Schemes. 237-248
Emanuela Fachini, Andrea Maggiolo-Schettini, Giovanni Resta, Davide Sangiorgi: Nonacceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata. 249-260
Gerhard Küster: On the Hurwitz Product of Formal Power Series and Automata. 261-273
Yossi Azar: Parallel Comparison Merging of Many-Ordered Lists. 275-285
Sukhamay Kundu: Minimal Strings in a Regular Language with Respect to a Partial Order on the Alphabet. 287-300
Joëlle Cohen-Chesnot: On the Expressive Power of Temporal Logic for Infinite Words. 301-312
Lane A. Hemachandra, Gerd Wechsung: Kolmogorov Characterizations of Complexity Classes. 313-322
Andrzej Wlodzimierz Mostowski: Hierarchies of Weak Automata and Weak Monadic Formulas. 323-335
Osamu Watanabe: On the p-Isomorphism Conjecture. 337-343