Theoretical Computer Science, Volume 94

Volume 94, Number 1, 1992

• Uwe Waldmann: Semantics of Order-Sorted Specifications. 1-35
• François Lamarche: Quantitative Domains and Infinitary Algebras. 37-62
• Ivan Filippenko, F. L. Morris: Domains for Logic Programming. 63-99
• Vincenzo Manca, Antonino Salibra: Soundness and Completeness of the Birkhoff Equational Calculus for Many-Sorted Algebras with Possibly Empty Carrier Sets. 101-124
• Paul Caspi: Clocks in Dataflow Languages. 125-140
• Maciej Koutny: Adequacy-Preserving Transformations of COSY Path Programs. 141-158

Volume 94, Number 2, 1992

• Jean-Paul Allouche, Patrick Morton, Jeffrey Shallit: Pattern Spectra, Substring Enumeration, and Automatic Sequences. 161-174
• Laurent Baratchart, M. Olivi, Franck Wielonsky: On a Rational Approximation Problem in the Real Hardy Space H2. 175-197
• Patrick Dehornoy: Probleme de mots dans les gerbes libres. 199-213
• Sébastien Ferenczi: Tiling the Morse Sequence. 215-221
• Christiane Frougny: Systemes de numeration linearires et Theta-representations. 223-236
• Didier Galmiche: Program Development in Constructive Type Theory. 237-259
• Danièle Gardy: Methode de col et lois limites en analyse combinatoire. 261-280
• Bernahrd Gil: Complete Extension of General Logic Programs. 281-294
• Gilles Lachaud: Artin-Schreier Curves, Exponential Sums, and Coding Theory. 295-310
• Dominique Méry: The N U System as a Development System for Concurrent Programs: delta N U. 311-334
• Michel Parigot: Recursive Programming with Proofs. 335-336
• Dominique Perrin: On Positive Matrices. 357-366
• Antonio Restivo: A Note on Renewal Systems. 367-371
• Zhi-Xiong Wen, Zhi-Ying Wen: Some Studies on the (p, q)-Type Sequences. 373-393