Theoretical Computer Science, Volume 65

Volume 65, Number 1, 1989

Patrice Enjalbert, Luis Fariñas del Cerro:
Modal Resolution in Clausal Form. 1-33
Martín Abadi:
The Power of Temporal Proofs. 35-83
Satish R. Thatte:
Full Abstraction and Limiting Completeness in Equational Languages. 85-119

Jean-Paul Allouche:
On a Sequence of Rational Functions. 123-130
François Blanchard:
beta-Expansions and Symbolic Dynamics. 131-141
Noëlle Bleuzen-Guernalec:
On a Possible Classification of Real-Time Constructed Sequences. 143-148
F. M. Dekking:
On the Probability of Occurrence of Labelled Subtrees of a Randomly Labelled Tree. 149-152
Jean-Marie Dumont, Alain Thomas:
Systemes de Numeration et Fonctions Fractales Relatifs aux Substitutions. 153-169
Georges Hansel, Dominique Perrin:
Rational Probability Measures. 171-188
Peter Hellekalek, Gerhard Larcher:
On Weyl Sums and Skew Products over Irrational Rotations. 189-196
Cor Kraaikamp:
Statistic and Ergodic Properties of Minkowski's Diagonal Continued Fraction. 197-212
Michel Mendès France, Alfred J. van der Poorten:
From Geometry to Euler Identities. 213-220
Filippo Mignosi:
Infinite Words with Linear Subword Complexity. 221-242
Makoto Mori:
On the Fredholm Determinant of a Piecewise Linear Transformation. 243-248
Brigitte Mossé:
q-Adic Spectral Analysis of Some Arithmetic Sequences. 249-263
Antonio Restivo:
Finitely Generated Sofic Systems. 265-270

Hirofumi Yokouchi:
Church-Rosser Theorem for a Rewriting System on Categorical Combinators. 271-290
Thérèse Hardin:
Confluence Results for the Pure Strong Categorical Logic CCL: lambda-Calculi as Subsystems of CCL. 291-342
John C. Shepherdson:
A Sound and Complete Semantics for a Version of Negation as Failure. 343-371

Last update Fri May 24 20:53:02 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page