Theoretical Computer Science
Collection
Collection
- ISSN: 0304-3975
Published by Elsevier
-
January 1976
-
Deterministic Lindenmayer languages nonterminals and homomorphisms, Article
Theoretical Computer Science, 2(1), 49-71.June 1976
-
Recursive assertions are not enough -- or are they? Article
Theoretical Computer Science, 73-87.K.R. Apt (Krzysztof), J.A. Bergstra (Jan) and L.G.L.T. Meertens (Lambert)
January 1979
-
Linear time and branching time semantics for recursion with merge Article
Theoretical Computer Science, 34(1-2), 135-156.J.W. de Bakker (Jaco), J.A. Bergstra (Jan), J.W. Klop (Jan Willem) and J.-J.C. Meyer (John-Jules)
January 1984 -
Ten years of Hoare s logic, a survey, part II: n ondeterminism Article
Theoretical Computer Science, 83-109.January 1984
-
Fair termination revisited - with delay Article
Theoretical Computer Science, 65-84.January 1984
-
Proving program inclusion using Hoare's logic Article
Theoretical Computer Science, 30(1), 1-48.January 1984 -
Corrigendum: 'On infinite computations in denotational semantics' Article
Theoretical Computer Science, 29(1-2), 229-230.J.W. de Bakker (Jaco), J.-J.C. Meyer (John-Jules) and J.I. Zucker
January 1984